Notre Dame Journal of Formal Logic
- Notre Dame J. Formal Logic
- Volume 52, Number 3 (2011), 315-329.
Automorphisms of Saturated and Boundedly Saturated Models of Arithmetic
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.
Notre Dame J. Formal Logic, Volume 52, Number 3 (2011), 315-329.
First available in Project Euclid: 28 July 2011
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Primary: 03C62: Models of arithmetic and set theory [See also 03Hxx]
Nurkhaidarov, Ermek S.; Shochat, Erez. Automorphisms of Saturated and Boundedly Saturated Models of Arithmetic. Notre Dame J. Formal Logic 52 (2011), no. 3, 315--329. doi:10.1215/00294527-1435483. https://projecteuclid.org/euclid.ndjfl/1311875777