Recursively saturated \(\omega _ 1\)-like models of arithmetic (Q800912): Difference between revisions

This paper is a continuation of a study of isomorphism types of \(\omega_ 1\)-like recursively saturated models of PA started by the author in Fundam. Math. 123, 123-131 (1984; Zbl 0545.03018). It is proved that for every countable recursively saturated model M of PA the family of pairwise nonisomorphic \(\omega_ 1\)-like recursively saturated elementary end extensions of M is of cardinality \(2^{\aleph_ 1}\). Assuming \(\diamond\) we can show that this family contains \(2^{\aleph_ 1}\) finitely determinate structures satisfying the same \(L_{\infty \omega_ 1}(aa)\) theory. It turns out that the \(\diamond\) assumption can be eliminated from the construction of \(2^{\aleph_ 1}\) pairwise nonisomorphic \(L_{\infty \omega_ 1}(aa)\)-elementarily equivalent models, however the structures constructed are no longer finitely determinate. It remains an open problem whether we can construct finitely determinate structures with the above properties without \(\diamond\).