Automorphisms of Countable Short Recursively Saturated Models of PA
Shochat, Erez
Notre Dame J. Formal Logic, Tome 49 (2008) no. 1, p. 345-360 / Harvested from Project Euclid
A model of Peano Arithmetic is short recursively saturated if it realizes all its bounded finitely realized recursive types. Short recursively saturated models of $\PA$ are exactly the elementary initial segments of recursively saturated models of $\PA$ . In this paper, we survey and prove results on short recursively saturated models of $\PA$ and their automorphisms. In particular, we investigate a certain subgroup of the automorphism group of such models. This subgroup, denoted $G|_{M(a)}$ , contains all the automorphisms of a countable short recursively saturated model of PA which can be extended to an automorphism of the countable recursively saturated elementary end extension of the model.
Publié le : 2008-10-15
Classification:  short recursive saturation,  recursive saturation,  models of PA,  automorphisms,  03C62
@article{1224257535,
     author = {Shochat, Erez},
     title = {Automorphisms of Countable Short Recursively Saturated Models of PA},
     journal = {Notre Dame J. Formal Logic},
     volume = {49},
     number = {1},
     year = {2008},
     pages = { 345-360},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1224257535}
}
Shochat, Erez. Automorphisms of Countable Short Recursively Saturated Models of PA. Notre Dame J. Formal Logic, Tome 49 (2008) no. 1, pp.  345-360. http://gdmltest.u-ga.fr/item/1224257535/