A simplified proof of arithmetical completeness theorem for provability logic GLP

DOI10.1134/S0081543811060046zbMath1294.03038OpenAlexW1574162351MaRDI QIDQ2510758

Lev D. Beklemishev

Publication date: 4 August 2014

Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0081543811060046

Mathematics Subject Classification ID

Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)

Related Items

On the reduction property for GLP-algebras ⋮ Positive provability logic for uniform reflection principles ⋮ The omega-rule interpretation of transfinite provability logic ⋮ On provability logics with linearly ordered modalities ⋮ Derived topologies on ordinals and stationary reflection ⋮ Interpolation properties for provability logics GL and GLP ⋮ Topological Interpretations of Provability Logic

Cites Work

• Unnamed Item
• Kripke semantics for provability logic GLP
• Provability interpretations of modal logic
• Reflection principles and provability algebras in formal arithmetic
• On strong provability predicates and the associated modal logics