Well ordering principles and -statements: A pilot study

Journal of Symbolic Logic 86 (2):709-745 (2021)
  Copy   BIBTEX

Abstract

In previous work, the author has shown that $\Pi ^1_1$ -induction along $\mathbb N$ is equivalent to a suitable formalization of the statement that every normal function on the ordinals has a fixed point. More precisely, this was proved for a representation of normal functions in terms of Girard’s dilators, which are particularly uniform transformations of well orders. The present paper works on the next type level and considers uniform transformations of dilators, which are called 2-ptykes. We show that $\Pi ^1_2$ -induction along $\mathbb N$ is equivalent to the existence of fixed points for all 2-ptykes that satisfy a certain normality condition. Beyond this specific result, the paper paves the way for the analysis of further $\Pi ^1_4$ -statements in terms of well ordering principles.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 94,070

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

How strong are single fixed points of normal functions?Anton Freund - 2020 - Journal of Symbolic Logic 85 (2):709-732.
Games and induction on reals.J. P. Aguilera & P. D. Welch - 2021 - Journal of Symbolic Logic 86 (4):1676-1690.
Proof-theoretic strengths of the well-ordering principles.Toshiyasu Arai - 2020 - Archive for Mathematical Logic 59 (3-4):257-275.
The veblen functions for computability theorists.Alberto Marcone & Antonio Montalbán - 2011 - Journal of Symbolic Logic 76 (2):575 - 602.
Primitive Recursion and the Chain Antichain Principle.Alexander P. Kreuzer - 2012 - Notre Dame Journal of Formal Logic 53 (2):245-265.
A note on ordinal exponentiation and derivatives of normal functions.Anton Freund - 2020 - Mathematical Logic Quarterly 66 (3):326-335.
Derivatives of normal functions and $$\omega $$ ω -models.Toshiyasu Arai - 2018 - Archive for Mathematical Logic 57 (5-6):649-664.
Luzin’s (n) and randomness reflection.Arno Pauly, Linda Westrick & Liang Yu - 2022 - Journal of Symbolic Logic 87 (2):802-828.

Analytics

Added to PP
2021-02-16

Downloads
17 (#866,957)

6 months
6 (#701,155)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

What is effective transfinite recursion in reverse mathematics?Anton Freund - 2020 - Mathematical Logic Quarterly 66 (4):479-483.
Weak and strong versions of Effective Transfinite Recursion.Patrick Uftring - 2023 - Annals of Pure and Applied Logic 174 (4):103232.

Add more citations

References found in this work

Reverse mathematics and ordinal exponentiation.Jeffry L. Hirst - 1994 - Annals of Pure and Applied Logic 66 (1):1-18.
Computable aspects of the Bachmann–Howard principle.Anton Freund - 2019 - Journal of Mathematical Logic 20 (2):2050006.
An ordinal analysis of parameter free Π12-comprehension.Michael Rathjen - 2005 - Archive for Mathematical Logic 44 (3):263-362.
Derivatives of normal functions in reverse mathematics.Anton Freund & Michael Rathjen - 2021 - Annals of Pure and Applied Logic 172 (2):102890.
What is effective transfinite recursion in reverse mathematics?Anton Freund - 2020 - Mathematical Logic Quarterly 66 (4):479-483.

View all 8 references / Add more references