A Uniform Characterization of 1-Reflection over the Fragments of Peano Arithmetic

Abstract

We show that the theory I1 of 1-induction proves the following statement: For all n≥ 2, the uniform 1-reflection principle over the theory In is equivalent to the totality of the function Fωn at stage ωn 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 n in the meta-theory (and also prove the separate cases n=0,1). 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 I1. It is well possible that this has been considered before. Our aim is merely to provide a detailed exposition of this important result.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…