Reflection ranks via infinitary derivations
Abstract: There is no infinite sequence of $\Pi1_1$-sound extensions of $\mathsf{ACA}_0$ each of which proves $\Pi1_1$-reflection of the next. This engenders a well-founded reflection ranking'' of $\Pi^1_1$-sound extensions of $\mathsf{ACA}_0$. For any $\Pi^1_1$-sound theory $T$ extending $\mathsf{ACA}^+_0$, the reflection rank of $T$ equals the proof-theoretic ordinal of $T$. This provides an alternative characterization of the notion ofproof-theoretic ordinal,'' which is one of the central concepts of proof theory. In this note we provide an alternative proof of this theorem using cut-elimination for infinitary derivations.
- Jean-Yves Girard. Proof Theory and Logical Complexity, volume 1. Humanities Press, 1987.
- Denis R Hirschfeldt. Slicing the Truth: On the Computable and Reverse Mathematics of Combinatorial Principles. World Scientific, 2015.
- The Veblen functions for computability theorists. Journal of Symbolic Logic, 76(2):575–602, 2011.
- Reflection ranks and ordinal analysis. The Journal of Symbolic Logic, 86:1350–1384, 2020.
- Wolfram Pohlers. Subsystems of set theory and second order number theory. Handbook of Proof Theory, 137:209–335, 1998.
- Ulf R Schmerl. A fine structure generated by reflection formulas over primitive recursive arithmetic. In Studies in Logic and the Foundations of Mathematics, volume 97, pages 335–350. Elsevier, 1979.
- Stephen G Simpson. Subsystems of Second Order Arithmetic. Cambridge University Press, 2009.
- James Walsh. On the hierarchy of natural theories. arXiv preprint arXiv:2106.05794, 2021.
- James Walsh. An incompleteness theorem via ordinal analysis. The Journal of Symbolic Logic, 89(1):80–96, 2024.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.