Interpretations of the alternative set theory (Q1313595): Difference between revisions

The paper is another one in a series of papers concerning the author's main interest: the metamathematics of alternative set theory (AST) and higher-order arithmetics (here, the third-order arithmetic and some modifications are considered). The author shows the strength of the full comprehension scheme (the quantification of class variables is allowed in formulas defining classes) and the axiom of prolongation (being a form of expressing \(\omega_ 1\)-saturation). Adding only extensionality and existence of sets \((\text{Set}(0)\&(\forall x,y)(\exists z)(z= x\cup\{y\}))\) we obtain a theory strong enough for interpreting the whole AST or third-order arithmetic. None of the four given axioms can be deleted. Another interesting result of the paper is that adding a suitable axiom (an adaptation of constructibility) of AST we obtain a theory in which the system of all classes is fully described by the system of all sets and the class FN (the class of all natural numbers having the property that every subclass is a set, by prolongation there are natural numbers without this property). The principal technical means used in the paper are an adaption of the constructible process (described formerly), the ultrapower construction and the fact that saturated elementary equivalent models are isomorphic. Note that in a previous paper of the author and J. Sgall the consistency of AST + there is a nonconstructible class is proved by an adaptation of the forcing method.