Hostname: page-component-586b7cd67f-gb8f7 Total loading time: 0 Render date: 2024-11-30T18:52:29.285Z Has data issue: false hasContentIssue false
  • English
  • Français

The strength of nonstandard methods in arithmetic

Published online by Cambridge University Press:  12 March 2014

C. Ward Henson ,
Matt Kaufmann  and
H. Jerome Keisler
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
Get access Rights & Permissions [Opens in a new window]

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.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 49 , Issue 4 , December 1984 , pp. 1039 - 1058
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.)

References

REFERENCES

[BS]Barwise, J. and Schlipf, J., On recursively saturated models in arithmetic, Model theory and algebra (Saracino, D. and Weispfenning, V. B., editors), Lecture Notes in Mathematics, vol. 498, Springer-Verlag, Berlin, 1975, pp. 42–55.CrossRefGoogle Scholar
[CK]Chang, C. C. and Keisler, H. J., Model theory, North-Holland, Amsterdam, 1973.Google Scholar
[F]Feferman, S., Theories of finite type related to mathematical practice, Handbook of mathematical logic (Barwise, J., editor), North-Holland, Amsterdam, 1977, pp. 913–971.CrossRefGoogle Scholar
[FS]Feferman, S. and Sieg, W., Proof theoretic equivalences between classical and constructive theories for analysis, Chapter 2 in Buchholz, W., Feferman, S., Pohlers, W. and Sieg, W., Iterated inductive definitions and subsystems of analysis, Lecture Notes in Mathematics, vol. 897, Springer-Verlag, Berlin, 1981, pp. 78–142.Google Scholar
[HK]Henson, C. W. and Keisler, H. J., The strength of nonstandard analysis (to appear).Google Scholar
[H1]Hrbáček, K., Axiomatic foundations for nonstandard analysis, Fundamenta Mathematicae, vol. 98 (1978), pp. 1–19.CrossRefGoogle Scholar
[H2]Hrbáček, K., Nonstandard set theory, American Mathematical Monthly, vol. 86 (1979), pp. 659–677.CrossRefGoogle Scholar
[Ka]Kawai, T., Axiom systems for nonstandard set theory, Logic Symposia, Hakone, 1979, 1980 (Müller, G. H., Takeuti, G. and Tugué, T., editors), Lecture Notes in Mathematics, vol. 891, Springer-Verlag, Berlin, 1981, pp. 57–65.CrossRefGoogle Scholar
[Kr]Kreisel, G., Axiomatizations of nonstandard analysis that are conservative extensions of formal systems for classical standard analysis, Applications of model theory to algebra, analysis, and probability (Luxemburg, W. A. J., editor), Holt, Rinehart and Winston, New York, 1969, pp. 93–106.Google Scholar
[Lo]Loeb, P., An introduction to nonstandard analysis and hyperfinite probability theory, Probabilistic analysis and related topics (Bharucha-Reid, A. T., editor), Academic Press, New York, 1979, pp. 105–142.CrossRefGoogle Scholar
[Lu]Luxemburg, W. A. J., A general theory of monads, Applications of model theory to algebra, analysis, and probability (Luxemburg, W. A. J., editor), Holt, Rinehart and Winston, New York, 1969, pp. 18–86.Google Scholar
[M ]Mycielski, J., Analysis without actual infinity, this Journal, vol. 46 (1981), pp. 625–633.Google Scholar
[N]Nelson, E., Internal set theory: a new approach to nonstandard analysis, Bulletin of the American Mathematical Society, vol. 83 (1977), pp. 1165–1198.CrossRefGoogle Scholar
[Pab]Pabion, J. F., Saturated models of Peano arithmetic, this Journal, vol. 47 (1982), pp. 625–637.Google Scholar
[Par]Parikh, R., A conservation result, Applications of model theory to algebra, analysis, and probability (Luxemburg, W. A. J., editor), Holt, Rinehart and Winston, New York, 1969, pp. 107–108.Google Scholar
[R]Robinson, A., Nonstandard analysis, North-Holland, Amsterdam, 1974.Google Scholar
[Si]Simpson, S., Reverse mathematics (to appear).Google Scholar
[Sm]Smoryński, C., The incompleteness theorem, Handbook of mathematical logic (Barwise, J., editor), North-Holland, Amsterdam, 1977, pp. 821–865.CrossRefGoogle Scholar
[V]Vopěnka, P., Mathematics in the alternative set theory, Teubner, Leipzig, 1979.Google Scholar