Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
