The strength of nonstandard methods in arithmetic

Journal of Symbolic Logic 49 (4):1039-1058 (1984)
  Copy   BIBTEX

Abstract

We consider extensions of Peano arithmetic suitable for doing some of nonstandard analysis, in which there is a predicate N(x) for an elementary initial segment, along with axiom schemes approximating ω 1 -saturation. We prove that such systems have the same proof-theoretic strength as their natural analogues in second order arithmetic. We close by presenting an even stronger extension of Peano arithmetic, which is equivalent to ZF for arithmetic statements

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 107,376

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

An Effective Conservation Result for Nonstandard Arithmetic.Erik Palmgren - 2000 - Mathematical Logic Quarterly 46 (1):17-24.
Nonstandard arithmetic and reverse mathematics.H. Jerome Keisler - 2006 - Bulletin of Symbolic Logic 12 (1):100-125.
The strength of countable saturation.Benno van den Berg, Eyvind Briseid & Pavol Safarik - 2017 - Archive for Mathematical Logic 56 (5-6):699-711.
A model of peano arithmetic with no elementary end extension.George Mills - 1978 - Journal of Symbolic Logic 43 (3):563-567.
The Diversity of Minimal Cofinal Extensions.James H. Schmerl - 2022 - Notre Dame Journal of Formal Logic 63 (4):493-514.
On certain types and models for arithmetic.Andreas Blass - 1974 - Journal of Symbolic Logic 39 (1):151-162.

Analytics

Added to PP
2009-01-28

Downloads
292 (#102,854)

6 months
32 (#123,855)

Historical graph of downloads
How can I increase my downloads?