Model-theoretic properties characterizing Peano arithmetic

Journal of Symbolic Logic 56 (3):949-963 (1991)
  Copy   BIBTEX

Abstract

Let= {0,1, +,·,<} be the usual first-order language of arithmetic. We show that Peano arithmetic is the least first-order-theory containingIΔ0+ exp such that every complete extensionTof it has a countable modelKsatisfying(i)Khas no proper elementary substructures, and(ii) wheneverL≻Kis a countable elementary extension there isandsuch that.Other model-theoretic conditions similar to (i) and (ii) are also discussed and shown to characterize Peano arithmetic.

Categories

Keywords

Reprint years

DOI

10.2307/2275063

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

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.
Expanding the additive reduct of a model of Peano arithmetic.Masahiko Murakami & Akito Tsuboi - 2003 - Mathematical Logic Quarterly 49 (4):363-368.
Generic cuts in models of arithmetic.Richard Kaye - 2008 - Mathematical Logic Quarterly 54 (2):129-144.
On Models Constructed by Means of the Arithmetized Completeness Theorem.Richard Kaye & Henryk Kotlarski - 2000 - Mathematical Logic Quarterly 46 (4):505-516.
A model of peano arithmetic with no elementary end extension.George Mills - 1978 - Journal of Symbolic Logic 43 (3):563-567.
On interstices of countable arithmetically saturated models of Peano arithmetic.Nicholas Bamber & Henryk Kotlarski - 1997 - Mathematical Logic Quarterly 43 (4):525-540.
Interstitial and pseudo gaps in models of Peano Arithmetic.Ermek S. Nurkhaidarov - 2010 - Mathematical Logic Quarterly 56 (2):198-204.
The strength of nonstandard methods in arithmetic.C. Ward Henson, Matt Kaufmann & H. Jerome Keisler - 1984 - Journal of Symbolic Logic 49 (4):1039-1058.
Models without indiscernibles.Fred G. Abramson & Leo A. Harrington - 1978 - Journal of Symbolic Logic 43 (3):572-600.
Torre models in the isols.Joseph Barback - 1994 - Journal of Symbolic Logic 59 (1):140-150.
On the complexity of models of arithmetic.Kenneth McAloon - 1982 - Journal of Symbolic Logic 47 (2):403-415.
The Theory of $\kappa$ -like Models of Arithmetic.Richard Kaye - 1995 - Notre Dame Journal of Formal Logic 36 (4):547-559.
An Effective Conservation Result for Nonstandard Arithmetic.Erik Palmgren - 2000 - Mathematical Logic Quarterly 46 (1):17-24.
Fixed points in Peano arithmetic with ordinals.Gerhard Jäger - 1993 - Annals of Pure and Applied Logic 60 (2):119-132.
Turing–Taylor Expansions for Arithmetic Theories.Joost J. Joosten - 2016 - Studia Logica 104 (6):1225-1243.

Analytics

Added to PP
2016-06-30

Downloads
11 (#1,110,001)

6 months
3 (#992,474)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The Theory of $\kappa$ -like Models of Arithmetic.Richard Kaye - 1995 - Notre Dame Journal of Formal Logic 36 (4):547-559.

Add more citations

References found in this work

On cofinal extensions of models of fragments of arithmetic.Richard Kaye - 1991 - Notre Dame Journal of Formal Logic 32 (3):399-408.

Add more references