Evitable iterates of the consistency operator

Computability 12 (1):59--69 (2023)
  Copy   BIBTEX

Abstract

Why are natural theories pre-well-ordered by consistency strength? In previous work, an approach to this question was proposed. This approach was inspired by Martin's Conjecture, one of the most prominent conjectures in recursion theory. Fixing a reasonable subsystem $T$ of arithmetic, the goal was to classify the recursive functions that are monotone with respect to the Lindenbaum algebra of $T$. According to an optimistic conjecture, roughly, every such function must be equivalent to an iterate $\mathsf{Con}_T^\alpha$ of the consistency operator ``in the limit'' within the ultrafilter of sentences that are true in the standard model. In previous work the author established the first case of this optimistic conjecture; roughly, every recursive monotone function is either as weak as the identity operator in the limit or as strong as $\mathsf{Con}_T$ in the limit. Yet in this note we prove that this optimistic conjecture fails already at the next step; there are recursive monotone functions that are neither as weak as $\mathsf{Con}_T$ in the limit nor as strong as $\mathsf{Con}_T^2$ in the limit. In fact, for every $\alpha$, we produce a function that is cofinally equivalent to $\mathsf{Con}^\alpha_T$ yet cofinally equivalent to $\mathsf{Con}_T$.

Other Versions

No versions found

Links

PhilArchive

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

A note on the consistency operator.James Walsh - 2020 - Proceedings of the American Mathematical Society 148 (6):2645--2654.
On the inevitability of the consistency operator.Antonio Montalbán & James Walsh - 2019 - Journal of Symbolic Logic 84 (1):205-225.
A note on da Costa-Doria “exotic formalizations”.L. Gordeev - 2010 - Archive for Mathematical Logic 49 (7-8):813-821.
Results on Martin’s Conjecture.Patrick Lutz - 2021 - Bulletin of Symbolic Logic 27 (2):219-220.
Bounded Martin’s Maximum with an Asterisk.David Asperó & Ralf Schindler - 2014 - Notre Dame Journal of Formal Logic 55 (3):333-348.
Games and induction on reals.J. P. Aguilera & P. D. Welch - 2021 - Journal of Symbolic Logic 86 (4):1676-1690.

Analytics

Added to PP
2023-02-10

Downloads
269 (#100,454)

6 months
86 (#72,527)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

James Walsh
New York University

Citations of this work

No citations found.

Add more citations

References found in this work

Iterated local reflection versus iterated consistency.Lev Beklemishev - 1995 - Annals of Pure and Applied Logic 75 (1-2):25-48.
A note on the consistency operator.James Walsh - 2020 - Proceedings of the American Mathematical Society 148 (6):2645--2654.
On the inevitability of the consistency operator.Antonio Montalbán & James Walsh - 2019 - Journal of Symbolic Logic 84 (1):205-225.

Add more references