Journal of Symbolic Logic 49 (4):1039-1058 (1984)
AbstractWe 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
Added to PP
Historical graph of downloads
Citations of this work
Nonstandard Arithmetic and Reverse Mathematics.H. Jerome Keisler - 2006 - Bulletin of Symbolic Logic 12 (1):100-125.
The Mathematical Intelligencer Flunks the Olympics.Alexander E. Gutman, Mikhail G. Katz, Taras S. Kudryk & Semen S. Kutateladze - 2017 - Foundations of Science 22 (3):539-555.
Hyperfinite Models of Adapted Probability Logic.H. Jerome Keisler - 1986 - Annals of Pure and Applied Logic 31:71-86.
Sequences in Countable Nonstandard Models of the Natural Numbers.Steven C. Leth - 1988 - Studia Logica 47 (3):243 - 263.
Some Nonstandard Methods in Combinatorial Number Theory.Steven C. Leth - 1988 - Studia Logica 47 (3):265 - 278.
Similar books and articles
A Model of Peano Arithmetic with No Elementary End Extension.George Mills - 1978 - Journal of Symbolic Logic 43 (3):563-567.
On the Complexity of Models of Arithmetic.Kenneth McAloon - 1982 - Journal of Symbolic Logic 47 (2):403-415.
Regularity in Models of Arithmetic.George Mills & Jeff Paris - 1984 - Journal of Symbolic Logic 49 (1):272-280.
Transfer Principles in Nonstandard Intuitionistic Arithmetic.Jeremy Avigad & Jeffrey Helzner - 2002 - Archive for Mathematical Logic 41 (6):581-602.
On Certain Types and Models for Arithmetic.Andreas Blass - 1974 - Journal of Symbolic Logic 39 (1):151-162.