Incompleteness and jump hierarchies
HTML articles powered by AMS MathViewer
- by Patrick Lutz and James Walsh
- Proc. Amer. Math. Soc. 148 (2020), 4997-5006
- DOI: https://doi.org/10.1090/proc/15125
- Published electronically: July 29, 2020
- PDF | Request permission
Corrigendum: Proc. Amer. Math. Soc. 149 (2021), 3143-3144.
Abstract:
This paper is an investigation of the relationship between Gödel’s second incompleteness theorem and the well-foundedness of jump hierarchies. It follows from a classic theorem of Spector that the relation $\{(A,B) \in \mathbb {R}^2 : \mathcal {O}^A \leq _H B\}$ is well-founded. We provide an alternative proof of this fact that uses Gödel’s second incompleteness theorem instead of the theory of admissible ordinals. We then derive a semantic version of the second incompleteness theorem, originally due to Mummert and Simpson, from this result. Finally, we turn to the calculation of the ranks of reals in this well-founded relation. We prove that, for any $A\in \mathbb {R}$, if the rank of $A$ is $\alpha$, then $\omega _1^A$ is the $(1 + \alpha )$th admissible ordinal. It follows, assuming suitable large cardinal hypotheses, that, on a cone, the rank of $X$ is $\omega _1^X$.References
- Lev D. Beklemishev, Provability algebras and proof-theoretic ordinals. I, Ann. Pure Appl. Logic 128 (2004), no. 1-3, 103–123. MR 2060550, DOI 10.1016/j.apal.2003.11.030
- H. B. Enderton and Hilary Putnam, A note on the hyperarithmetical hierarchy, J. Symbolic Logic 35 (1970), 429–430. MR 290971, DOI 10.2307/2270699
- Harvey Friedman, Uniformly defined descending sequences of degrees, J. Symbolic Logic 41 (1976), no. 2, 363–367. MR 429527, DOI 10.2307/2272234
- Joseph Harrison, Recursive pseudo-well-orderings, Trans. Amer. Math. Soc. 131 (1968), 526–543. MR 244049, DOI 10.1090/S0002-9947-1968-0244049-7
- Juliette Kennedy, Did the Incompleteness Theorems Refute Hilbert’s Program?, Stanford Encyclopedia of Philosophy, 2015.
- S. Kripke, The Collapse of the Hilbert Program: Why a System Cannot Prove its Own 1-consistency, Bull. Symbolic Logic 15 (2009), no. 2, 229–230.
- Carl Mummert and Stephen G. Simpson, An incompleteness theorem for $\beta _n$-models, J. Symbolic Logic 69 (2004), no. 2, 612–616. MR 2058191, DOI 10.2178/jsl/1082418545
- Fedor Pakhomov and James Walsh, Reflection ranks and ordinal analysis, arXiv preprint arXiv:1805.02095 (2018).
- Stephen G. Simpson, Subsystems of second order arithmetic, 2nd ed., Perspectives in Logic, Cambridge University Press, Cambridge; Association for Symbolic Logic, Poughkeepsie, NY, 2009. MR 2517689, DOI 10.1017/CBO9780511581007
- John Steel, Descending sequences of degrees, J. Symbolic Logic 40 (1975), no. 1, 59–61. MR 450048, DOI 10.2307/2272271
- John R. Steel, Forcing with tagged trees, Ann. Math. Logic 15 (1978), no. 1, 55–74. MR 511943, DOI 10.1016/0003-4843(78)90026-8
Bibliographic Information
- Patrick Lutz
- Affiliation: Department of Mathematics, University of California Berkeley, Berkeley, California 94720
- MR Author ID: 1399453
- ORCID: 0000-0001-9930-4183
- Email: pglutz@berkeley.edu
- James Walsh
- Affiliation: Department of Philosophy, Cornell University, Ithaca, New York 14853
- MR Author ID: 1312343
- Email: jameswalsh@cornell.edu
- Received by editor(s): September 23, 2019
- Received by editor(s) in revised form: April 2, 2020
- Published electronically: July 29, 2020
- Communicated by: Heike Mildenberger
- © Copyright 2020 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 148 (2020), 4997-5006
- MSC (2010): Primary 03F35, 03D55; Secondary 03F40
- DOI: https://doi.org/10.1090/proc/15125
- MathSciNet review: 4143409