Saturated Models of Peano Arithmetic
Pabion, J. F.
J. Symbolic Logic, Tome 47 (1982) no. 1, p. 625-637 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
We study reducts of Peano arithmetic for which conditions of saturation imply the corresponding conditions for the whole model. It is shown that very weak reducts (like pure order) have such a property for $\kappa$-saturation in every $\kappa \geq \omega_1$. In contrast, other reducts do the job for $\omega$ and not for $\kappa > \omega_1$. This solves negatively a conjecture of Chang.
Publié le : 1982-09-14
Classification:  
@article{1183741090,
     author = {Pabion, J. F.},
     title = {Saturated Models of Peano Arithmetic},
     journal = {J. Symbolic Logic},
     volume = {47},
     number = {1},
     year = {1982},
     pages = { 625-637},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183741090}
}

Pabion, J. F. Saturated Models of Peano Arithmetic. J. Symbolic Logic, Tome 47 (1982) no. 1, pp.  625-637. http://gdmltest.u-ga.fr/item/1183741090/