Reflection algebras and conservation results for theories of iterated truth
From MaRDI portal
Publication:2120976
Recommendations
Cites work
- scientific article; zbMATH DE number 1003731 (Why is no real title available?)
- scientific article; zbMATH DE number 3857078 (Why is no real title available?)
- scientific article; zbMATH DE number 3668596 (Why is no real title available?)
- scientific article; zbMATH DE number 3572133 (Why is no real title available?)
- scientific article; zbMATH DE number 1028815 (Why is no real title available?)
- scientific article; zbMATH DE number 1170091 (Why is no real title available?)
- scientific article; zbMATH DE number 3797742 (Why is no real title available?)
- scientific article; zbMATH DE number 227056 (Why is no real title available?)
- scientific article; zbMATH DE number 6302903 (Why is no real title available?)
- scientific article; zbMATH DE number 5046774 (Why is no real title available?)
- A note on strictly positive logics and word rewriting systems
- Arithmetization of metamathematics in a general setting
- Axiomatic theories of truth
- Bounded Induction and Satisfaction Classes
- Calibrating provability logic: from modal logic to reflection calculus
- Cuts, consistency statements and interpretations
- From hierarchies to well-foundedness
- Inductive full satisfaction classes
- Local collection and end-extensions of models of compositional truth
- Models of transfinite provability logic
- Notes on bounded induction for the compositional truth predicate
- On provability logics with linearly ordered modalities
- On the positive fragment of the polymodal provability logic GLP
- Positive provability logic for uniform reflection principles
- Proof theory. An introduction
- Proof-theoretic analysis by iterated reflection
- Provability algebras and proof-theoretic ordinals. I
- Reflecting on incompleteness
- Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems
- Reflection calculus and conservativity spectra
- Reflection principles and provability algebras in formal arithmetic
- Reflection ranks and ordinal analysis
- Self-reference and modal logic
- Systems of predicative analysis
- The logic of Turing progressions
- The omega-rule interpretation of transfinite provability logic
- The optimality of induction as an axiomatization of arithmetic
- The unfolding of non-finitist arithmetic
- Truth and reflection
- Truth, disjunction, and induction
- Turing Jumps Through Provability
- Turing-Taylor expansions for arithmetic theories
- Well-orders in the transfinite Japaridze algebra
Cited in
(12)- Iterated reflection over full disquotational truth
- AN ESCAPE FROM VARDANYAN’S THEOREM
- Indiscernibles and satisfaction classes in arithmetic
- An Effective Conservation Result for Nonstandard Arithmetic
- Varieties of truth definitions
- 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
- Reflection algebras and conservation results for theories of iterated truth
- 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)