English

Local reflection, definable elements and 1-provability

Logic 2020-10-20 v2

Abstract

In this note we study several topics related to the schema of local reflection Rfn(T)\mathsf{Rfn}(T) and its partial and relativized variants. Firstly, we introduce the principle of uniform reflection with Σn\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 Σn+2\Sigma_{n+2}-conservativity of uniform Σn+1\Sigma_{n+1}-reflection over relativized local Σn+1\Sigma_{n+1}-reflection. We also study the proof-theoretic strength of Feferman's theorem, i.e., the assertion of 11-provability in SS of the local reflection schema Rfn(S)\mathsf{Rfn}(S), and its generalized versions. We relate this assertion to the uniform Σ2\Sigma_2-reflection schema and, in particular, obtain an alternative axiomatization of IΣ1\mathsf{I}\Sigma_1.

Keywords

Cite

@article{arxiv.1907.06464,
  title  = {Local reflection, definable elements and 1-provability},
  author = {Evgeny Kolmakov},
  journal= {arXiv preprint arXiv:1907.06464},
  year   = {2020}
}
R2 v1 2026-06-23T10:21:07.253Z