Reflection algebras and conservation results for theories of iterated truth
DOI10.1016/J.APAL.2022.103093OpenAlexW4226257708WikidataQ114209360 ScholiaQ114209360MaRDI QIDQ2120976FDOQ2120976
Authors: 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
Recommendations
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)
Cites Work
- Title not available (Why is that?)
- Axiomatic theories of truth
- Arithmetization of metamathematics in a general setting
- Cuts, consistency statements and interpretations
- Reflecting on incompleteness
- Title not available (Why is that?)
- Title not available (Why is that?)
- Proof-theoretic analysis by iterated reflection
- Provability algebras and proof-theoretic ordinals. I
- Title not available (Why is that?)
- Reflection principles and provability algebras in formal arithmetic
- Title not available (Why is that?)
- Proof theory. An introduction
- Systems of predicative analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Truth and reflection
- Self-reference and modal logic
- Well-orders in the transfinite Japaridze algebra
- On the positive fragment of the polymodal provability logic GLP
- Title not available (Why is that?)
- Positive provability logic for uniform reflection principles
- Calibrating provability logic: from modal logic to reflection calculus
- Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems
- The omega-rule interpretation of transfinite provability logic
- On provability logics with linearly ordered modalities
- Models of transfinite provability logic
- Title not available (Why is that?)
- From hierarchies to well-foundedness
- Turing Jumps Through Provability
- Turing-Taylor expansions for arithmetic theories
- Inductive full satisfaction classes
- The optimality of induction as an axiomatization of arithmetic
- Reflection ranks and ordinal analysis
- Bounded Induction and Satisfaction Classes
- Reflection calculus and conservativity spectra
- Truth, disjunction, and induction
- The unfolding of non-finitist arithmetic
- A note on strictly positive logics and word rewriting systems
- The logic of Turing progressions
- Notes on bounded induction for the compositional truth predicate
- Title not available (Why is that?)
- Local collection and end-extensions of models of compositional truth
Cited In (12)
- Iterated reflection over full disquotational truth
- AN ESCAPE FROM VARDANYAN’S THEOREM
- Indiscernibles and satisfaction classes in arithmetic
- Varieties of truth definitions
- An Effective Conservation Result for Nonstandard Arithmetic
- Reflection algebras and conservation results for theories of iterated truth
- MODEL THEORY AND PROOF THEORY OF THE GLOBAL REFLECTION PRINCIPLE
- An ‘i’ for an i, a Truth for a Truth†
- Hyperarithmetical worm battles
- Conservativity spectra and Joosten-Fernández model
- Iterated local reflection versus iterated consistency
- A consistency proof for some restrictions of Tait's reflection principles
This page was built for publication: Reflection algebras and conservation results for theories of iterated truth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2120976)
