Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-17T22:19:02.118Z Has data issue: false hasContentIssue false

The strength of nonstandard methods in arithmetic

Published online by Cambridge University Press:  12 March 2014

C. Ward Henson
Affiliation:
University of Illinois, Urbana, Illinois 61801
Matt Kaufmann
Affiliation:
Purdue University, West Lafayette, Indiana 47907
H. Jerome Keisler
Affiliation:
University of Wisconsin, Madison, Wisconsin 53706

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.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1984

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable