Automorphisms of Saturated and Boundedly Saturated Models of Arithmetic
Notre Dame Journal of Formal Logic 52 (3):315-329 (2010)
| 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 | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,664 |
| External links |
  Try with proxy. |
| Through your library | Configure |
Similar books and articlesRoman Kossak (1995). Four Problems Concerning Recursively Saturated Models of Arithmetic. Notre Dame Journal of Formal Logic 36 (4):519-530.
Samuel Coskey & Roman Kossak (2010). The Complexity of Classification Problems for Models of Arithmetic. Bulletin of Symbolic Logic 16 (3):345-358.
James H. Schmerl (2012). Elementary Cuts in Saturated Models of Peano Arithmetic. Notre Dame Journal of Formal Logic 53 (1):1-13.
Erez Shochat (2008). Automorphisms of Countable Short Recursively Saturated Models of PA. Notre Dame Journal of Formal Logic 49 (4):345-360.
Roman Kossak (1989). Models with the Ω-Property. Journal of Symbolic Logic 54 (1):177-189.
Friederike Körner (1998). Automorphisms Moving All Non-Algebraic Points and an Application to NF. Journal of Symbolic Logic 63 (3):815-830.
Henryk Kotlarski (1995). Automorphisms of Countable Recursively Saturated Models of PA: A Survey. Notre Dame Journal of Formal Logic 36 (4):505-518.
Benoît Mariou (2001). Modèles Saturés Et Modèles Engendrés Par Des Indiscernables. Journal of Symbolic Logic 66 (1):325-348.
C. Smoryński (1981). Recursively Saturated Nonstandard Models of Arithmetic. Journal of Symbolic Logic 46 (2):259-286.
C. Smoryński (1982). Recursively Saturated Nonstandard Models of Arithmetic; Addendum. Journal of Symbolic Logic 47 (3):493-494.
Tapani Hyttinen & Saharon Shelah (2001). Main Gap for Locally Saturated Elementary Submodels of a Homogeneous Structure. Journal of Symbolic Logic 66 (3):1286-1302.
C. Smoryński (1981). Elementary Extensions of Recursively Saturated Models of Arithmetic. Notre Dame Journal of Formal Logic 22 (3):193-203.
C. Smoryński (1982). A Note on Initial Segment Constructions in Recursively Saturated Models of Arithmetic. Notre Dame Journal of Formal Logic 23 (4):393-408.
Fredrik Engström & Richard W. Kaye (2012). Transplendent Models: Expansions Omitting a Type. Notre Dame Journal of Formal Logic 53 (3):413-428.
Fredrik Engström & Richard W. Kaye (2012). Transplendent Models: Expansions Omitting a Type. Notre Dame Journal of Formal Logic 53 (3):413-428.
Analytics
Monthly downloads |
Added to index2011-07-29Total downloads3 ( #201,781 of 549,010 )Recent downloads (6 months)1 ( #63,261 of 549,010 )How can I increase my downloads? |
My notes
Discussion
