Calibrating provability logic: from modal logic to reflection calculus

MaRDI QIDQ5419872zbMATH OpenFDO

Authors Lev D. Beklemishev

Publication date 11 June 2014

zbMATH Keywords

ordinal analysisordinal representation systempositive fragments of modal logicprovability logicsunprovable combinatorial principles

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)

Recommendations

• The Worm Calculus
• Positive provability logic for uniform reflection principles
• \(\Pi_1^0\)-ordinal analysis beyond first-order arithmetic
• Reflection calculus and conservativity spectra
• On the reflection calculus with partial conservativity operators

Cited in

(14)

• Axiomatization and polynomial solvability of strictly positive fragments of certain modal logics
• Reflection algebras and conservation results for theories of iterated truth
• The logic of Turing progressions
• The calculus of higher-level rules, propositional quantification, and the foundational approach to proof-theoretic harmony
• Deducibility and independence in Beklemishev's autonomous provability calculus
• \(\Pi_1^0\)-ordinal analysis beyond first-order arithmetic
• On some slowly terminating term rewriting systems
• Positive provability logic for uniform reflection principles
• Reflection ranks and ordinal analysis
• A note on strictly positive logics and word rewriting systems
• Kripke completeness of strictly positive modal logics over meet-semilattices with operators
• Reflection calculus and conservativity spectra
• AN ESCAPE FROM VARDANYAN’S THEOREM
• Strictly positive fragments of the provability logic of Heyting arithmetic

This page was built for publication: Calibrating provability logic: from modal logic to reflection calculus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5419872)