Four Problems Concerning Recursively Saturated Models of Arithmetic
Notre Dame Journal of Formal Logic 36 (4):519-530 (1995)
| Abstract | The paper presents four open problems concerning recursively saturated models of Peano Arithmetic. One problems concerns a possible converse to Tarski's undefinability of truth theorem. The other concern elementary cuts in countable recursively saturated models, extending automorphisms of countable recursively saturated models, and Jonsson models of PA. Some partial answers are given. | |||||||||
| Keywords | Models of arithmetic, recursive saturation, Jonsson models, undefibability of truth, automorphisms of models of PA | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,882 |
| External links |
  Try with proxy. |
| Through your library | Configure |
Similar books and articlesSamuel Coskey & Roman Kossak (2010). The Complexity of Classification Problems for Models of Arithmetic. Bulletin of Symbolic Logic 16 (3):345-358.
Ermek S. Nurkhaidarov & Erez Shochat (2010). Automorphisms of Saturated and Boundedly Saturated Models of Arithmetic. Notre Dame Journal of Formal Logic 52 (3):315-329.
Roman Kossak (1989). Models with the Ω-Property. Journal of Symbolic Logic 54 (1):177-189.
James H. Schmerl (2012). Elementary Cuts in Saturated Models of Peano Arithmetic. Notre Dame Journal of Formal Logic 53 (1):1-13.
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.
Stuart T. Smith (1987). Nonstandard Characterizations of Recursive Saturation and Resplendency. Journal of Symbolic Logic 52 (3):842-863.
Fredrik Engström & Richard W. Kaye (2012). Transplendent Models: Expansions Omitting a Type. Notre Dame Journal of Formal Logic 53 (3):413-428.
Roman Kossak (1985). Recursively Saturated $\Omega_1$-Like Models of Arithmetic. Notre Dame Journal of Formal Logic 26 (4):413-422.
Bożena Piekart (1993). On Closed Elementary Cuts in Recursively Saturated Models of Peano Arithmetic. Notre Dame Journal of Formal Logic 34 (2):223-230.
Roman Kossak & James H. Schmerl (2012). On Cofinal Submodels and Elementary Interstices. Notre Dame Journal of Formal Logic 53 (3):267-287.
C. Smoryński (1981). Recursively Saturated Nonstandard Models of Arithmetic. Journal of Symbolic Logic 46 (2):259-286.
C. Smoryński (1981). Elementary Extensions of Recursively Saturated Models of Arithmetic. Notre Dame Journal of Formal Logic 22 (3):193-203.
Henryk Kotlarski (1995). Automorphisms of Countable Recursively Saturated Models of PA: A Survey. Notre Dame Journal of Formal Logic 36 (4):505-518.
Erez Shochat (2008). Automorphisms of Countable Short Recursively Saturated Models of PA. Notre Dame Journal of Formal Logic 49 (4):345-360.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2010-08-24Total downloads1 ( #277,406 of 556,914 )Recent downloads (6 months)1 ( #64,931 of 556,914 )How can I increase my downloads? |
My notes
Discussion
