Author:
Henson C. Ward,Kaufmann Matt,Keisler H. Jerome
Abstract
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.
Publisher
Cambridge University Press (CUP)
Reference19 articles.
1. The Incompleteness Theorems
2. Henson C. W. and Keisler H. J. , The strength of nonstandard analysis (to appear).
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The strength of countable saturation;Archive for Mathematical Logic;2017-06-21
2. The Mathematical Intelligencer Flunks the Olympics;Foundations of Science;2016-03-15
3. ARITHMETIC GEOMETRY OVER HYPERTRANSCENDENTAL FIELDS;International Journal of Modern Physics B;2007-09-30
4. The strength of nonstandard analysis;The Strength of Nonstandard Analysis;2007
5. A Theory of Hyperfinite Sets;Annals of Pure and Applied Logic;2006-11