Graduate studies at Western
Journal of Symbolic Logic 43 (3):563-567 (1978)
|Abstract||We construct a model of Peano arithmetic in an uncountable language which has no elementary end extension. This answers a question of Gaifman and contrasts with the well-known theorem of MacDowell and Specker which states that every model of Peano arithmetic in a countable language has an elementary end extension. The construction employs forcing in a nonstandard model|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
Joseph Barback (1994). Torre Models in the Isols. Journal of Symbolic Logic 59 (1):140-150.
Vladimir Kanovei (1996). On External Scott Algebras in Nonstandard Models of Peano Arithmetic. Journal of Symbolic Logic 61 (2):586-607.
Fred G. Abramson & Leo A. Harrington (1978). Models Without Indiscernibles. Journal of Symbolic Logic 43 (3):572-600.
Saharon Shelah (1978). End Extensions and Numbers of Countable Models. Journal of Symbolic Logic 43 (3):550-562.
Ali Enayat (2001). Power-Like Models of Set Theory. Journal of Symbolic Logic 66 (4):1766-1782.
Andreas Blass (1974). On Certain Types and Models for Arithmetic. Journal of Symbolic Logic 39 (1):151-162.
Kenneth McAloon (1982). On the Complexity of Models of Arithmetic. Journal of Symbolic Logic 47 (2):403-415.
C. Ward Henson, Matt Kaufmann & H. Jerome Keisler (1984). The Strength of Nonstandard Methods in Arithmetic. Journal of Symbolic Logic 49 (4):1039-1058.
Matt Kaufmann (1983). Blunt and Topless End Extensions of Models of Set Theory. Journal of Symbolic Logic 48 (4):1053-1073.
Richard Kaye (1991). Model-Theoretic Properties Characterizing Peano Arithmetic. Journal of Symbolic Logic 56 (3):949-963.
Sorry, there are not enough data points to plot this chart.
Added to index2009-01-28
Total downloads1 ( #292,381 of 739,348 )
Recent downloads (6 months)0
How can I increase my downloads?