On principles between ∑1- and ∑2-induction, and monotone enumerations

Journal of Mathematical Logic 16 (1):1650004 (2016)
  Copy   BIBTEX

Abstract

We show that many principles of first-order arithmetic, previously only known to lie strictly between [Formula: see text]-induction and [Formula: see text]-induction, are equivalent to the well-foundedness of [Formula: see text]. Among these principles are the iteration of partial functions of Hájek and Paris, the bounded monotone enumerations principle by Chong, Slaman, and Yang, the relativized Paris–Harrington principle for pairs, and the totality of the relativized Ackermann–Péter function. With this we show that the well-foundedness of [Formula: see text] is a far more widespread than usually suspected. Further, we investigate the [Formula: see text]-iterated version of the bounded monotone iterations principle, and show that it is equivalent to the well-foundedness of the -height [Formula: see text]-tower [Formula: see text].

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 76,419

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2016-06-11

Downloads
20 (#566,060)

6 months
1 (#452,962)

Historical graph of downloads
How can I increase my downloads?