The generic filter property in nonstandard analysis (Q5942882)

Within nonstandard analysis, the main result in this interesting paper is the equivalence between Henson's isomorphism property for finite languages and a combinatorial principle. Let \(\mathcal D\) be any family of sets. A filter \(G\) is \(\mathcal D\)-generic if \(G \cap D \not= \emptyset\) for each \(D \in \mathcal D.\) Principle \(\Delta_1\) states: Let \(P\) be an internal poset, \(\mathbb N\) the natural numbers, and \(\{{\mathcal D}_\xi\mid \xi \in {}^*\mathbb N\}\) an internal collection. Let \({\mathcal D} = \bigcup \{{\mathcal D}_n\mid n \in {\mathbb N}\}.\) If there is a nonempty \(Q \subset P\) such every \(D \in \mathcal D\) is \(Q\)-dense, then there exits a \(\mathcal D\)-generic filter \(G\) on \(P.\) Under a standard formulation for nonstandard analysis such as using only a bounded separation schema, the author establishes that Henson's isomorphism property for finite languages is equivalent to \(\Delta_1.\)