scientific article; zbMATH DE number 4023270

From MaRDI portal
Publication:3765769





This paper contains two new results. The first concerns the metamathematics of the alternative set theory (AST) and it fully solves the problem of finding the weakest theory in which AST is interpretable. It is proved that the essential axiom which cannot be deleted from AST, is the prolongation axiom (a weak form suffices). If we remember that the prolongation axiom expresses a form of saturation property then this result should be compared with the content of the paper of \textit{C. W. Henson} and \textit{H. J. Keisler} in J. Symb. Logic. 51, 377-386 (1986; Zbl 0624.03051). The result is obtained by a composition of several interpretations of some mathematical theories. The interpretation modifying Gödel's constructible process plays a substantial role here. Recently the author has strengthened his result. He investigates the constructible process in nonstandard higher order arithmetics. For AST he obtains a faithful interpretation (i.e. for a suitable axiom (called axiom of constructibility) AST \(+ this\) axiom describes fully the interpreted theory). This result is not yet published. The second result concerns the possibility of prolongations of the relation of satisfaction for set (arithmetical) formulas. It is not difficult to prove that for every infinitely large natural number \(\alpha\), there are two prolongations X, Y of the relation of satisfaction equally with properties described by normal formulas such as the relation of satisfaction has and such that \(X\upharpoonright \alpha \neq Y\upharpoonright \alpha\). (For all finite formulas the corresponding classes must be the same \((X\{n\}=Y\{n\}=Sat\{n\})\) and somewhere under \(\alpha\) the corresponding classes differ.) The author proves in the paper that a large (uncodable) system of classes exists such that every class of the system prolongs the relation of satisfaction (it has the same properties as the relation of satisfaction) and for every two classes from this system and every infinitely large \(\alpha\), \(X\upharpoonright \alpha \neq Y\upharpoonright \alpha\). (Every two classes of this system differ arbitrarily low above the finite formulas.)











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3765769)