Local reflection, definable elements and 1-provability

Abstract

In this note we study several topics related to the schema of local reflection Rfn(T) and its partial and relativized variants. Firstly, we introduce the principle of uniform reflection with n-definable parameters, establish its relationship with the relativized local reflection principles and corresponding versions of induction with definable parameters. Using this schema we give a new model-theoretic proof of the n+2-conservativity of uniform n+1-reflection over relativized local n+1-reflection. We also study the proof-theoretic strength of Feferman's theorem, i.e., the assertion of 1-provability in S of the local reflection schema Rfn(S), and its generalized versions. We relate this assertion to the uniform 2-reflection schema and, in particular, obtain an alternative axiomatization of I1.

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…