Reflection principles and provability algebras in formal arithmetic
From MaRDI portal
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Cut-elimination and normal-form theorems (03F05) Recursive ordinals and ordinal notations (03F15) First-order arithmetic and fragments (03F30) Gödel numberings and issues of incompleteness (03F40) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)
Recommendations
Cited in
(76)- On the reflection calculus with partial conservativity operators
- The logical strength of compositional principles
- Minimalism and the generalisation problem: on Horwich's second solution
- A universal algebra for the variable-free fragment of \({\mathrm{RC}^\nabla}\)
- Axiomatizing provable \(n\)-provability
- Parameter free induction and provably total computable functions
- The implicit commitment of arithmetical theories and its semantic core
- Unprovability results for clause set cycles
- The number of axioms
- Reflection algebras and conservation results for theories of iterated truth
- Hyperarithmetical worm battles
- The logic of Turing progressions
- Local reflection, definable elements and 1-provability
- On a strengthening of the non-isomorphism theorem for provability algebras
- Uniform density in Lindenbaum algebras
- On the reduction property for GLP-algebras
- Slow reflection
- A simplified proof of arithmetical completeness theorem for provability logic GLP
- On the limit existence principles in elementary arithmetic and \(\varSigma_{n}^{0}\)-consequences of theories
- Characterizations of ordinal analysis
- On elementary theories of ordinal notation systems based on reflection principles
- Arithmetical reflection and the provability of soundness
- scientific article; zbMATH DE number 2185723 (Why is no real title available?)
- Consistency and the theory of truth
- The Henkin sentence
- Reflection Principles in Fragments of Peano Arithmetic
- scientific article; zbMATH DE number 4072964 (Why is no real title available?)
- Positive provability logic for uniform reflection principles
- The paradox of the knower revisited
- Reflecting on incompleteness
- scientific article; zbMATH DE number 1048040 (Why is no real title available?)
- Provability and interpretability logics with restricted realizations
- Generalizations of Gödel's incompleteness theorems for \(\Sigma_n\)-definable theories of arithmetic
- ON THE INEVITABILITY OF THE CONSISTENCY OPERATOR
- Proof theoretic analysis by iterated reflection
- Derived topologies on ordinals and stationary reflection
- Transfinite Progressions: A Second Look at Completeness
- On the complexity of the closed fragment of Japaridze's provability logic
- scientific article; zbMATH DE number 1431685 (Why is no real title available?)
- Provably recursive functions of reflection
- Gödel's second incompleteness theorem: how it is derived and what it delivers
- MÜNCHHAUSEN PROVABILITY
- Reflection ranks and ordinal analysis
- Hierarchical incompleteness results for arithmetically definable extensions of fragments of arithmetic
- A note on fragments of uniform reflection in second order arithmetic
- A mathematical commitment without computational strength
- A uniform characterization of \(\Sigma_1\)-reflection over the fragments of Peano arithmetic
- Turing-Taylor expansions for arithmetic theories
- AXIOMATIZATION OF PROVABLE n-PROVABILITY
- Topological interpretations of provability logic
- PREDICATIVITY THROUGH TRANSFINITE REFLECTION
- Reflection calculus and conservativity spectra
- On the optimality of conservation results for local reflection in arithmetic
- Evitable iterates of the consistency operator
- HOW STRONG IS RAMSEY’S THEOREM IF INFINITY CAN BE WEAK?
- MODEL THEORY AND PROOF THEORY OF THE GLOBAL REFLECTION PRINCIPLE
- ON SHAVRUKOV’S NON-ISOMORPHISM THEOREM FOR DIAGONALIZABLE ALGEBRAS
- Semi-honest subrecursive degrees and the collection rule in arithmetic
- AXIOMATIZATIONS OF PEANO ARITHMETIC: A TRUTH-THEORETIC VIEW
- Kripke semantics for provability logic GLP
- Varieties of truth definitions
- On provability logics of Niebergall arithmetic
- Saul Kripke (1940--2022)
- Adventures in Gödel Incompleteness
- A theory of implicit commitment
- On the hierarchy of natural theories
- Reflexivity of -consistency in a general setting
- On the conservation results for local reflection principles
- General notions of consistency
- Mathematical developments of the incompleteness theorems
- Chair of Mathematical Logic and Theory of Algorithms
- On the unification problem for \(\operatorname{GLP} \)
- Principles for object-linguistic consequence: from logical to irreflexive
- Henkin sentences and local reflection principles for Rosser provability
- Transductions in arithmetic
- Arithmetic with a local reflection principle for Rosser provability formulas
This page was built for publication: Reflection principles and provability algebras in formal arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3372439)
