The strength of nonstandard methods in arithmetic

Journal of Symbolic Logic 49 (4):1039-1058 (1984)
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
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2274260
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 16,667
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA
P. V. Andreev & E. I. Gordon (2006). A Theory of Hyperfinite Sets. Annals of Pure and Applied Logic 143 (1):3-19.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

128 ( #19,836 of 1,726,249 )

Recent downloads (6 months)

112 ( #9,578 of 1,726,249 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.