A Uniform Characterization of $\Sigma_1$-Reflection over the Fragments of Peano Arithmetic
Anton Freund

TL;DR
This paper provides a detailed proof-theoretic analysis showing that the uniform $ ext{Sigma}_1$-reflection over fragments of Peano Arithmetic is equivalent to the totality of certain fast-growing functions, all within a low-level theory.
Contribution
It offers an explicit internal proof of the equivalence between reflection principles and fast-growing functions in a weak base theory, filling a gap in the literature.
Findings
Uniform $ ext{Sigma}_1$-reflection over $I ext{Sigma}_n$ corresponds to the totality of $F_{ ext{omega}_n}$.
The proof formalizes the connection within $I ext{Sigma}_1$, avoiding stronger meta-theoretic assumptions.
Provides a detailed exposition of an important result in proof theory.
Abstract
We show that the theory of -induction proves the following statement: For all , the uniform -reflection principle over the theory is equivalent to the totality of the function at stage of the fast-growing hierarchy. The method applied is a formalization of infinite proof theory. The literature contains several proofs which place the quantification over in the meta-theory (and also prove the separate cases ). In contrast, the author knows of no explicit argument that would allow us to internalize the quantification while keeping the meta-theory as low as . It is well possible that this has been considered before. Our aim is merely to provide a detailed exposition of this important result.
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
TopicsMathematical and Theoretical Analysis · History and Theory of Mathematics · Computability, Logic, AI Algorithms
