A model of peano arithmetic with no elementary end extension

Journal of Symbolic Logic 43 (3):563-567 (1978)
  Copy   BIBTEX

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

Categories

Keywords

Reprint years

DOI

10.2307/2273532

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,636

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Model-theoretic properties characterizing Peano arithmetic.Richard Kaye - 1991 - Journal of Symbolic Logic 56 (3):949-963.
Substructure lattices and almost minimal end extensions of models of Peano arithmetic.James H. Schmerl - 2004 - Mathematical Logic Quarterly 50 (6):533-539.
A standard model of Peano Arithmetic with no conservative elementary extension.Ali Enayat - 2008 - Annals of Pure and Applied Logic 156 (2):308-318.
The Pentagon as a Substructure Lattice of Models of Peano Arithmetic.James H. Schmerl - forthcoming - Journal of Symbolic Logic:1-20.
Nonstandard models that are definable in models of Peano Arithmetic.Kazuma Ikeda & Akito Tsuboi - 2007 - Mathematical Logic Quarterly 53 (1):27-37.
On certain types and models for arithmetic.Andreas Blass - 1974 - Journal of Symbolic Logic 39 (1):151-162.
Every Countable Model of Arithmetic or Set Theory has a Pointwise-Definable End Extension.Joel David Hamkins - forthcoming - Kriterion – Journal of Philosophy.
Relatively Recursively Enumerable Versus Relatively Σ1 in Models of Peano Arithmetic.Grzegorz Michalski - 1995 - Mathematical Logic Quarterly 41 (4):515-522.
Blunt and topless end extensions of models of set theory.Matt Kaufmann - 1983 - Journal of Symbolic Logic 48 (4):1053-1073.
The strength of nonstandard methods in arithmetic.C. Ward Henson, Matt Kaufmann & H. Jerome Keisler - 1984 - Journal of Symbolic Logic 49 (4):1039-1058.

Analytics

Added to PP
2009-01-28

Downloads
53 (#412,169)

6 months
16 (#192,948)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Minimal elementary extensions of models of set theory and arithmetic.Ali Enayat - 1990 - Archive for Mathematical Logic 30 (3):181-192.
Models of expansions of equation image with no end extensions.Saharon Shelah - 2011 - Mathematical Logic Quarterly 57 (4):341-365.

Add more citations

References found in this work

Models and types of Peano's arithmetic.Haim Gaifman - 1976 - Annals of Mathematical Logic 9 (3):223-306.

Add more references