Arithmetically Saturated Models of Arithmetic
Notre Dame Journal of Formal Logic 36 (4):531-546 (1995)
| Abstract | This article has no associated abstract. (fix it) | |||||||||
| 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,705 |
| 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.
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.
James H. Schmerl (2012). Elementary Cuts in Saturated Models of Peano Arithmetic. Notre Dame Journal of Formal Logic 53 (1):1-13.
Roman Kossak (1985). Recursively Saturated $\Omega_1$-Like Models of Arithmetic. Notre Dame Journal of Formal Logic 26 (4):413-422.
Ermek S. Nurkhaidarov (2006). Automorphism Groups of Arithmetically Saturated Models. Journal of Symbolic Logic 71 (1):203 - 216.
James H. Schmerl (2002). Some Highly Saturated Models of Peano Arithmetic. Journal of Symbolic Logic 67 (4):1265-1273.
Roman Kossak (1989). Models with the Ω-Property. Journal of Symbolic Logic 54 (1):177-189.
Roman Kossak & James H. Schmerl (2012). On Cofinal Submodels and Elementary Interstices. Notre Dame Journal of Formal Logic 53 (3):267-287.
Roman Kossak, Mark Nadel & James Schmerl (1989). A Note on the Multiplicative Semigroup of Models of Peano Arithmetic. Journal of Symbolic Logic 54 (3):936-940.
C. Smoryński (1981). Recursively Saturated Nonstandard Models of Arithmetic. Journal of Symbolic Logic 46 (2):259-286.
Roman Kossak & James H. Schmerl (1991). Minimal Satisfaction Classes with an Application to Rigid Models of Peano Arithmetic. Notre Dame Journal of Formal Logic 32 (3):392-398.
C. Smoryński (1982). Recursively Saturated Nonstandard Models of Arithmetic; Addendum. Journal of Symbolic Logic 47 (3):493-494.
Victor Harnik (1986). Ω1-Like Recursively Saturated Models of Presburger's Arithmetic. Journal of Symbolic Logic 51 (2):421 - 429.
C. Smoryński (1981). Elementary Extensions of Recursively Saturated Models of Arithmetic. Notre Dame Journal of Formal Logic 22 (3):193-203.
Analytics
Monthly downloads |
Added to index2010-08-24Total downloads2 ( #232,628 of 549,198 )Recent downloads (6 months)1 ( #63,397 of 549,198 )How can I increase my downloads? |
My notes
Discussion
