Rather classless, highly saturated models of Peano arithmetic
A a subset \(X\) of a model \(M\models \text{PA}\) is a class of \(M\) if, for every \(a\in M\), the set \(\{x\in M:x<a\}\) is definable in \(M\). We say that \(M\) is rather classless if every class of \(M\) is definable in \(M\). There are no saturated rather classless models of PA. Rather classless models of PA with various degrees of saturation were constructed earlier in separate papers by Kaufmann, Keisler, and the author. In this paper the author proves the ultimate result: If \(\lambda\) is a regular cardinal, \(N\models \text{PA}\) is \(\lambda\)-saturated and \(\lambda<| N| \), then there is a rather classless, \(\lambda\)-saturated model \(M\) such that \(N\prec M\) and \(| M| =| N| \). For the entire collection see [Zbl 0893.00029].
This page was built for publication: Rather classless, highly saturated models of Peano arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4218531)