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.
Citation
Ermek S. Nurkhaidarov. Erez Shochat. "Automorphisms of Saturated and Boundedly Saturated Models of Arithmetic." Notre Dame J. Formal Logic 52 (3) 315 - 329, 2011. https://doi.org/10.1215/00294527-1435483
Information
