Definability of Initial Segments

Notre Dame Journal of Formal Logic 43 (2):65-73 (2002)
  Copy   BIBTEX

Abstract

In any nonstandard model of Peano arithmetic, the standard part is not first-order definable. But we show that in some model the standard part is definable as the unique solution of a formula , where P is a unary predicate variable

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,296

External links

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

Through your library

Similar books and articles

Definability and initial segments of c-degrees.Robert S. Lubarsky - 1988 - Journal of Symbolic Logic 53 (4):1070-1081.
Nonstandard definability.Stuart T. Smith - 1989 - Annals of Pure and Applied Logic 42 (1):21-43.
Theories of arithmetics in finite models.Michał Krynicki & Konrad Zdanowski - 2005 - Journal of Symbolic Logic 70 (1):1-28.
Tennenbaum's Theorem and Unary Functions.Sakae Yaegasi - 2008 - Notre Dame Journal of Formal Logic 49 (2):177-183.
Submodels and definable points in models of Peano arithmetic.Žarko Mijajlović - 1983 - Notre Dame Journal of Formal Logic 24 (4):417-425.
Pointwise definable substructures of models of Peano arithmetic.Roman Murawski - 1988 - Notre Dame Journal of Formal Logic 29 (3):295-308.
The arithmetic of cuts in models of arithmetic.Richard Kaye - 2013 - Mathematical Logic Quarterly 59 (4-5):332-351.

Analytics

Added to PP
2010-08-24

Downloads
13 (#1,066,279)

6 months
38 (#100,987)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Implicit Definability of Subfields.Akito Tsuboi & Kenji Fukuzaki - 2003 - Notre Dame Journal of Formal Logic 44 (4):217-225.

Add more citations

References found in this work

Some highly saturated models of Peano arithmetic.James H. Schmerl - 2002 - Journal of Symbolic Logic 67 (4):1265-1273.

Add more references