Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Local reflection, definable elements and 1-provability (1907.06464v2)

Published 15 Jul 2019 in math.LO

Abstract: In this note we study several topics related to the schema of local reflection $\mathsf{Rfn}(T)$ and its partial and relativized variants. Firstly, we introduce the principle of uniform reflection with $\Sigma_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 $\Sigma_{n+2}$-conservativity of uniform $\Sigma_{n+1}$-reflection over relativized local $\Sigma_{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 $\mathsf{Rfn}(S)$, and its generalized versions. We relate this assertion to the uniform $\Sigma_2$-reflection schema and, in particular, obtain an alternative axiomatization of $\mathsf{I}\Sigma_1$.

Summary

We haven't generated a summary for this paper yet.