Topological completeness of the provability logic GLP
From MaRDI portal
(Redirected from Publication:490656)
Abstract: Provability logic GLP is well-known to be incomplete w.r.t. Kripke semantics. A natural topological semantics of GLP interprets modalities as derivative operators of a polytopological space. Such spaces satisfying all the axioms of GLP are called GLP-spaces. We develop some constructions to build nontrivial GLP-spaces and show that GLP is complete w.r.t. the class of all GLP-spaces.
Recommendations
Cited in
(21)- A topological study of the closed fragment of GLP
- Models of transfinite provability logic
- The polytopologies of transfinite provability logic
- Positive provability logic for uniform reflection principles
- A topological completeness theorem for transfinite provability logic
- The intuitionistic temporal logic of dynamical systems
- A simplified proof of arithmetical completeness theorem for provability logic GLP
- Topological interpretations of provability logic
- Derived topologies on ordinals and stationary reflection
- Global neighbourhood completeness of the Gödel-Löb provability logic
- On the reduction property for GLP-algebras
- Ordinal completeness of bimodal provability logic GLB
- Strong completeness of provability logic for ordinal spaces
- Deducibility and independence in Beklemishev's autonomous provability calculus
- Kripke semantics for provability logic GLP
- MÜNCHHAUSEN PROVABILITY
- Geometric modal logic
- The omega-rule interpretation of transfinite provability logic
- COMPLETENESS OF THE GÖDEL–LÖB PROVABILITY LOGIC FOR THE FILTER SEQUENCE OF NORMAL MEASURES
- scientific article; zbMATH DE number 5862929 (Why is no real title available?)
- On provability logics with linearly ordered modalities
This page was built for publication: Topological completeness of the provability logic GLP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q490656)