Reflection principles and provability algebras in formal arithmetic
From MaRDI portal
Publication:3372439
DOI10.1070/RM2005v060n02ABEH000823zbMath1097.03054OpenAlexW2041395883MaRDI QIDQ3372439
Publication date: 21 February 2006
Published in: Russian Mathematical Surveys (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1070/rm2005v060n02abeh000823
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Cut-elimination and normal-form theorems (03F05) First-order arithmetic and fragments (03F30) Recursive ordinals and ordinal notations (03F15) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45) Gödel numberings and issues of incompleteness (03F40)
Related Items
On the reduction property for GLP-algebras, Evitable iterates of the consistency operator, The number of axioms, Reflection algebras and conservation results for theories of iterated truth, On elementary theories of ordinal notation systems based on reflection principles, A MATHEMATICAL COMMITMENT WITHOUT COMPUTATIONAL STRENGTH, The Henkin Sentence, Hyperarithmetical worm battles, CONSISTENCY AND THE THEORY OF TRUTH, The logic of Turing progressions, Positive provability logic for uniform reflection principles, The paradox of the knower revisited, Henkin sentences and local reflection principles for Rosser provability, HOW STRONG IS RAMSEY’S THEOREM IF INFINITY CAN BE WEAK?, MODEL THEORY AND PROOF THEORY OF THE GLOBAL REFLECTION PRINCIPLE, Characterizations of ordinal analysis, 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, PREDICATIVITY THROUGH TRANSFINITE REFLECTION, GENERALIZATIONS OF GÖDEL’S INCOMPLETENESS THEOREMS FOR ∑n-DEFINABLE THEORIES OF ARITHMETIC, Transductions in arithmetic, Kripke semantics for provability logic GLP, The logical strength of compositional principles, Local reflection, definable elements and 1-provability, Provability and interpretability logics with restricted realizations, Minimalism and the generalisation problem: on Horwich's second solution, Reflection calculus and conservativity spectra, Parameter free induction and provably total computable functions, ON THE INEVITABILITY OF THE CONSISTENCY OPERATOR, Axiomatizing provable \(n\)-provability, On the complexity of the closed fragment of Japaridze's provability logic, Derived topologies on ordinals and stationary reflection, Turing-Taylor expansions for arithmetic theories, On a strengthening of the non-isomorphism theorem for provability algebras, Uniform density in Lindenbaum algebras, Principles for object-linguistic consequence: from logical to irreflexive, A simplified proof of arithmetical completeness theorem for provability logic GLP, The implicit commitment of arithmetical theories and its semantic core, AXIOMATIZATION OF PROVABLE n-PROVABILITY, GÖDEL’S SECOND INCOMPLETENESS THEOREM: HOW IT IS DERIVED AND WHAT IT DELIVERS, Unprovability results for clause set cycles, Topological Interpretations of Provability Logic, MÜNCHHAUSEN PROVABILITY, REFLECTION RANKS AND ORDINAL ANALYSIS, HIERARCHICAL INCOMPLETENESS RESULTS FOR ARITHMETICALLY DEFINABLE EXTENSIONS OF FRAGMENTS OF ARITHMETIC
