Kripke semantics for provability logic GLP

DOI10.1016/J.APAL.2009.06.011MaRDI QIDQ636316zbMATH OpenOpenAlexFDO

Authors Lev D. Beklemishev

Publication date 26 August 2011

Published in Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.apal.2009.06.011

zbMATH Keywords

completenessKripke semanticspolymodal provability logicGLP

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 5862929
• scientific article; zbMATH DE number 6302903
• Topological completeness of the provability logic GLP
• A Finitary Treatment of the Closed Fragment of Japaridze's Provability Logic
• A simplified proof of arithmetical completeness theorem for provability logic GLP

Cites work

• scientific article; zbMATH DE number 1003731 (Why is no real title available?)
• scientific article; zbMATH DE number 3554258 (Why is no real title available?)
• scientific article; zbMATH DE number 3554259 (Why is no real title available?)
• scientific article; zbMATH DE number 1170091 (Why is no real title available?)
• scientific article; zbMATH DE number 4195937 (Why is no real title available?)
• A Finitary Treatment of the Closed Fragment of Japaridze's Provability Logic
• Modal logic
• On strong provability predicates and the associated modal logics
• PSPACE-decidability of Japaridze's polymodal logic
• Provability algebras and proof-theoretic ordinals. I
• Reflection principles and provability algebras in formal arithmetic

Cited in

(21)

• A many-sorted variant of Japaridze's polymodal provability logic
• The polytopologies of transfinite provability logic
• Positive provability logic for uniform reflection principles
• A topological completeness theorem for transfinite provability logic
• Interpolation properties for provability logics GL and GLP
• Provability and interpretability logics with restricted realizations
• A simplified proof of arithmetical completeness theorem for provability logic GLP
• Topological interpretations of provability logic
• A Finitary Treatment of the Closed Fragment of Japaridze's Provability Logic
• Nested sequents for provability logic GLP: FIG. 1.
• The analytical completeness of Dzhaparidze's polymodal logics
• Kripke semantics and proof systems for combining intuitionistic logic and classical logic
• On the Craig interpolation and the fixed point properties for GLP
• Derived topologies on ordinals and stationary reflection
• On the positive fragment of the polymodal provability logic GLP
• On the reduction property for GLP-algebras
• On provability logics of Niebergall arithmetic
• Topological completeness of the provability logic GLP
• Linear \(\mathrm{GLP}\)-algebras and their elementary theories
• The omega-rule interpretation of transfinite provability logic
• On provability logics with linearly ordered modalities

This page was built for publication: Kripke semantics for provability logic GLP

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