Notre Dame Journal of Formal Logic 52 (3):315-329 (2011)

Abstract
We discuss automorphisms of saturated models of PA and boundedly saturated models of PA. We show that Smoryński's Lemma and Kaye's Theorem are not only true for countable recursively saturated models of PA but also true for all boundedly saturated models of PA with slight modifications
Keywords saturation   bounded saturation   automorphism groups   models of PA
Categories (categorize this paper)
Reprint years 2011
DOI 10.1215/00294527-1435483
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: 65,657
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
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.
Saturated Models of Peano Arithmetic.J. F. Pabion - 1982 - Journal of Symbolic Logic 47 (3):625-637.
The Intersection of Nonstandard Models of Arithmetic.Andreas Blass - 1972 - Journal of Symbolic Logic 37 (1):103-106.

View all 9 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.
Elementary Cuts in Saturated Models of Peano Arithmetic.James H. Schmerl - 2012 - Notre Dame Journal of Formal Logic 53 (1):1-13.
Automorphisms of Countable Short Recursively Saturated Models of PA.Erez Shochat - 2008 - Notre Dame Journal of Formal Logic 49 (4):345-360.
Models with the Ω-Property.Roman Kossak - 1989 - Journal of Symbolic Logic 54 (1):177-189.
Automorphisms of Countable Recursively Saturated Models of PA: A Survey.Henryk Kotlarski - 1995 - Notre Dame Journal of Formal Logic 36 (4):505-518.
Recursively Saturated Nonstandard Models of Arithmetic.C. Smoryński - 1981 - Journal of Symbolic Logic 46 (2):259-286.
Elementary Extensions of Recursively Saturated Models of Arithmetic.C. Smoryński - 1981 - Notre Dame Journal of Formal Logic 22 (3):193-203.
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
2011-07-29

Total views
18 ( #594,565 of 2,462,339 )

Recent downloads (6 months)
1 ( #449,321 of 2,462,339 )

How can I increase my downloads?

Downloads

My notes