AXIOMATIZATION OF PROVABLE n-PROVABILITY

DOI10.1017/JSL.2018.82zbMath1444.03165arXiv1805.00381OpenAlexW2798507261MaRDI QIDQ5222538

Evgeny Kolmakov, Lev D. Beklemishev

Publication date: 6 April 2020

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

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

zbMATH Keywords

Peano arithmeticreflection principle\(n\)-provabilitystrong provability predicateTuring progression

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45) Gödel numberings and issues of incompleteness (03F40) Relative consistency and interpretations (03F25)

Related Items (3)

ON SHAVRUKOV’S NON-ISOMORPHISM THEOREM FOR DIAGONALIZABLE ALGEBRAS ⋮ Local reflection, definable elements and 1-provability ⋮ HIERARCHICAL INCOMPLETENESS RESULTS FOR ARITHMETICALLY DEFINABLE EXTENSIONS OF FRAGMENTS OF ARITHMETIC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Self-reference and modal logic
• Interpretability of various extensions of arithmetic
• Induction rules, reflection principles, and provably recursive functions
• Proof-theoretic analysis by iterated reflection
• Provability algebras and proof-theoretic ordinals. I
• Parameter free induction and provably total computable functions
• On the limit existence principles in elementary arithmetic and \(\varSigma_{n}^{0}\)-consequences of theories
• Reflection principles and provability algebras in formal arithmetic
• The optimality of induction as an axiomatization of arithmetic
• Reflection Principles in Fragments of Peano Arithmetic
• On parameter free induction schemas
• On strong provability predicates and the associated modal logics
• Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems
• Transfinite recursive progressions of axiomatic theories
• Systems of Logic Based on Ordinals^†

This page was built for publication: AXIOMATIZATION OF PROVABLE n-PROVABILITY