“…In this paper we show how Choquet's capacitability theorem can be used when countably determined sets are replaced by Souslin sets. Although the class of countably determined sets is much wider than the class of Souslin sets (the class of countably determined sets contains the class of projective sets of finite rank), which makes the results obtained by Henson more general, we believe that the proof we present here gives an interesting example of the more extensive use of Choquet's theorem in Nonstandard Analysis (see [HR,R,Zl,Z3]). …”