Reflection algebras and conservation results for theories of iterated truth

DOI10.1016/j.apal.2022.103093OpenAlexW4226257708WikidataQ114209360 ScholiaQ114209360MaRDI QIDQ2120976

Fedor N. Pakhomov, Lev D. Beklemishev

Publication date: 1 April 2022

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1908.10302

zbMATH Keywords

ordinal notationsprovability logictruth theoriesreflection principlespredicativity

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Second- and higher-order arithmetic and fragments (03F35) Recursive ordinals and ordinal notations (03F15) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)

Related Items

Hyperarithmetical worm battles, MODEL THEORY AND PROOF THEORY OF THE GLOBAL REFLECTION PRINCIPLE, AN ESCAPE FROM VARDANYAN’S THEOREM, Conservativity spectra and Joosten-Fernández model

Cites Work

• Positive provability logic for uniform reflection principles
• On provability logics with linearly ordered modalities
• From hierarchies to well-foundedness
• Turing-Taylor expansions for arithmetic theories
• Inductive full satisfaction classes
• Truth and reflection
• Self-reference and modal logic
• Proof-theoretic analysis by iterated reflection
• The unfolding of non-finitist arithmetic
• The omega-rule interpretation of transfinite provability logic
• Proof theory. An introduction
• Provability algebras and proof-theoretic ordinals. I
• The logic of Turing progressions
• Truth, disjunction, and induction
• On the positive fragment of the polymodal provability logic GLP
• Local collection and end-extensions of models of compositional truth
• Turing Jumps Through Provability
• Arithmetization of metamathematics in a general setting
• Reflection principles and provability algebras in formal arithmetic
• The optimality of induction as an axiomatization of arithmetic
• Cuts, consistency statements and interpretations
• Bounded Induction and Satisfaction Classes
• Reflecting on incompleteness
• Well-orders in the transfinite Japaridze algebra
• REFLECTION RANKS AND ORDINAL ANALYSIS
• A Note on Strictly Positive Logics and Word Rewriting Systems
• Models of transfinite provability logic
• Systems of predicative analysis
• NOTES ON BOUNDED INDUCTION FOR THE COMPOSITIONAL TRUTH PREDICATE
• Reflection calculus and conservativity spectra
• Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item