AN INCOMPLETENESS THEOREM VIA ORDINAL ANALYSIS

DOI10.1017/jsl.2022.64arXiv2109.09678OpenAlexW4295877858WikidataQ115052225 ScholiaQ115052225MaRDI QIDQ6123580

No author found.

Publication date: 5 April 2024

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2109.09678

zbMATH Keywords

proof theoryincompletenessordinal analysissecond-order arithmetic

Mathematics Subject Classification ID

Recursive ordinals and ordinal notations (03F15) Gödel numberings and issues of incompleteness (03F40)

Cites Work

• Unnamed Item
• The incompleteness theorems after 70 years
• Applications of cut-free infinitary derivations to generalized recursion theory
• Induction rules, reflection principles, and provably recursive functions
• Proof theory. An introduction
• Notation systems for infinitary derivations
• ON THE DIAGONAL LEMMA OF GÖDEL AND CARNAP
• The role of parameters in bar rule and bar induction
• REFLECTION RANKS AND ORDINAL ANALYSIS
• Incompleteness and jump hierarchies
• From Tarski to Gödel—or how to derive the second incompleteness theorem from the undefinability of truth without self-reference

This page was built for publication: AN INCOMPLETENESS THEOREM VIA ORDINAL ANALYSIS