Hostname: page-component-7479d7b7d-t6hkb Total loading time: 0 Render date: 2024-07-15T22:53:00.710Z Has data issue: false hasContentIssue false

Regularity in models of arithmetic

Published online by Cambridge University Press:  12 March 2014

George Mills
Affiliation:
Carleton College, Northfield, Minnesota 55057
Jeff Paris
Affiliation:
University of Manchester, Manchester ML3 9PL, England

Abstract

This paper investigates the quantifier “there exist unboundedly many” in the context of first-order arithmetic. An alternative axiomatization is found for Peano arithmetic based on an axiom schema of regularity: The union of boundedly many bounded sets is bounded. We also obtain combinatorial equivalents of certain second-order theories associated with cuts in nonstandard models of arithmetic.

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.)

References

REFERENCES

[1]Bennett, J., On spectra, Ph.D. dissertation, Princeton University, Princeton, N.J., 1962.Google Scholar
[2]Kirby, L., Initial segments of models of arithmetic, Ph.D. dissertation, University of Manchester, Manchester, 1977.Google Scholar
[3]Kirby, L. and Paris, J., Initial segments of models of Peano's axioms, Set theory and hierarchy theory. V (Proceedings of the Third Conference, Bierutowice, 1976), Lecture Notes in Mathematics, vol. 619, Springer-Verlag, Berlin, 1977, pp. 211226.Google Scholar
[4]Mills, G., Extensions of models of Peano arithmetic, Ph.D. dissertation, University of California, Berkeley, California, 1977.Google Scholar
[5]Paris, J., Some independence results for Peano arithmetic, this Journal, vol. 43 (1978), pp. 725731.Google Scholar
[6]Paris, J., A hierarchy of cuts in models of arithmetic, Model theory of algebra and arithmetic (Proceedings, Karpacz, 1979), Lecture Notes in Mathematics, vol. 834, Springer-Verlag, 1980, pp. 312337.CrossRefGoogle Scholar
[7]Paris, J. and Harrington, L., A mathematical incompleteness in Peano arithmetic, Handbook of mathematical logic (Barwise, J., editor), North-Holland, Amsterdam, 1977, pp. 11331142.CrossRefGoogle Scholar
[8]Paris, J. and Kirby, L., Σn-collection schemas in arithmetic, Logic Colloquium '77, North-Holland, Amsterdam, 1978, pp. 199209.CrossRefGoogle Scholar