The behavior of higher proof theory I: Case $\Sigma^1_2$
Hanul Jeon

TL;DR
This paper extends the understanding of proof-theoretic ordinals by establishing an equivalence between various comparison methods for $oldsymbol{ ext{Sigma}}^1_2$-consequences modulo true $oldsymbol{ ext{Pi}}^1_2$-sentences, generalizing previous results.
Contribution
It proves the equivalence between $oldsymbol{ ext{Sigma}}^1_2$-proof-theoretic ordinal, consequence, and reflection comparisons modulo true $oldsymbol{ ext{Pi}}^1_2$-sentences, advancing higher proof theory.
Findings
Established the equivalence between $oldsymbol{ ext{Sigma}}^1_2$-proof-theoretic ordinal and consequence comparison.
Connected $oldsymbol{ ext{Sigma}}^1_2$-proof-theoretic ordinal with the analogue of the reflection rank.
Extended prior results from $oldsymbol{ ext{Sigma}}^1_1$ to $oldsymbol{ ext{Sigma}}^1_2$-sentences.
Abstract
Walsh [MR4525964, Zbl 1569.03151] has shown that comparing proof-theoretic ordinals is equivalent to comparing -consequence comparison and -reflection comparison, all modulo true -sentences. In this paper, we prove the analogous result for -consequences modulo true -sentences, that is, the equivalence between -proof-theoretic ordinal comparison, -consequence comparison, and -reflection comparison, all modulo true -sentences. We also examine the connection between -proof-theoretic ordinal and -analogue of the robust reflection rank in Pakhomov-Walsh [MR4362917, Zbl 1511.03018]
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Mathematical and Theoretical Analysis · Computability, Logic, AI Algorithms
