Notre Dame Journal of Formal Logic 49 (4):345-360 (2008)

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 which can be extended to an automorphism of the countable recursively saturated elementary end extension of the model
Keywords short recursive saturation   recursive saturation   models of PA   automorphisms
Categories (categorize this paper)
DOI 10.1215/00294527-2008-016
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 69,043
Through your library

References found in this work BETA

Models and Types of Peano's Arithmetic.Haim Gaifman - 1976 - Annals of Mathematical Logic 9 (3):223-306.
Recursively Saturated Nonstandard Models of Arithmetic.C. Smoryński - 1981 - Journal of Symbolic Logic 46 (2):259-286.
Discernible Elements in Models for Peano Arithmetic.Andrzej Ehrenfeucht - 1973 - Journal of Symbolic Logic 38 (2):291-292.

View all 14 references / Add more references

Citations of this work BETA

Add more citations

Similar books and articles

Four Problems Concerning Recursively Saturated Models of Arithmetic.Roman Kossak - 1995 - Notre Dame Journal of Formal Logic 36 (4):519-530.
Automorphisms of Countable Recursively Saturated Models of PA: A Survey.Henryk Kotlarski - 1995 - Notre Dame Journal of Formal Logic 36 (4):505-518.
Models with the Ω-Property.Roman Kossak - 1989 - Journal of Symbolic Logic 54 (1):177-189.
Generic Expansions of Countable Models.Silvia Barbina & Domenico Zambella - 2012 - Notre Dame Journal of Formal Logic 53 (4):511-523.
Transplendent Models: Expansions Omitting a Type.Fredrik Engström & Richard W. Kaye - 2012 - Notre Dame Journal of Formal Logic 53 (3):413-428.

Analytics

Added to PP index
2010-09-13

Total views
20 ( #554,839 of 2,498,558 )

Recent downloads (6 months)
3 ( #211,850 of 2,498,558 )

How can I increase my downloads?

Downloads

My notes