Hostname: page-component-7b7567c8c-jswmv Total loading time: 0 Render date: 2026-11-15T12:48:17.241Z 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.

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