Local reflection, definable elements and 1-provability

Archive for Mathematical Logic 59 (7-8):979-996 (2020)
  Copy   BIBTEX

Abstract

In this note we study several topics related to the schema of local reflection \\) and its partial and relativized variants. Firstly, we introduce the principle of uniform reflection with \-definable parameters, establish its relationship with relativized local reflection principles and corresponding versions of induction with definable parameters. Using this schema we give a new model-theoretic proof of the \-conservativity of uniform \-reflection over relativized local \-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 \\), and its generalized versions. We relate this assertion to the uniform \-reflection schema and, in particular, obtain an alternative axiomatization of \.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,261

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

On the provability logic of bounded arithmetic.Rineke Verbrugge & Alessandro Berarducci - 1991 - Annals of Pure and Applied Logic 61 (1-2):75-93.
A course on bimodal provability logic.Albert Visser - 1995 - Annals of Pure and Applied Logic 73 (1):109-142.
Axiomatization of provable n-provability.Evgeny Kolmakov & Lev Beklemishev - 2019 - Journal of Symbolic Logic 84 (2):849-869.
Abelian groups with modular generic.James Loveys - 1991 - Journal of Symbolic Logic 56 (1):250-259.
Provability logic.Rineke Verbrugge - 2008 - Stanford Encyclopedia of Philosophy.
A Note on Defining Transcendentals in Function Fields.Arno Fehm & Wulf-Dieter Geyer - 2009 - Journal of Symbolic Logic 74 (4):1206 - 1210.
Perfect subsets of generalized baire spaces and long games.Philipp Schlicht - 2017 - Journal of Symbolic Logic 82 (4):1317-1355.
On properties of (weakly) small groups.Cédric Milliet - 2012 - Journal of Symbolic Logic 77 (1):94-110.
Rosser Provability and Normal Modal Logics.Taishi Kurahashi - 2020 - Studia Logica 108 (3):597-617.

Analytics

Added to PP
2020-03-31

Downloads
13 (#1,041,239)

6 months
6 (#530,265)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

The incompleteness theorems.Craig Smorynski - 1977 - In Jon Barwise (ed.), Handbook of mathematical logic. New York: North-Holland. pp. 821 -- 865.
Transfinite recursive progressions of axiomatic theories.Solomon Feferman - 1962 - Journal of Symbolic Logic 27 (3):259-316.
Reflection Principles and Their Use for Establishing the Complexity of Axiomatic Systems.Georg Kreisel & Azriel Lévy - 1968 - Zeitschrift für Mathematische Logic Und Grundlagen der Mathematik 14 (1):97--142.
Transfinite Recursive Progressions of Axiomatic Theories.Solomon Feferman - 1967 - Journal of Symbolic Logic 32 (4):530-531.

View all 14 references / Add more references