PSPACE-decidability of Japaridze's polymodal logic
From MaRDI portal
(Redirected from Publication:3085172)
Recommendations
Cited in
(19)- MÜNCHHAUSEN PROVABILITY
- Kripke semantics for provability logic GLP
- AN ESCAPE FROM VARDANYAN’S THEOREM
- PSPACE bounds for rank-1 modal logics
- On provability logics of Niebergall arithmetic
- Reflection calculus and conservativity spectra
- scientific article; zbMATH DE number 2020142 (Why is no real title available?)
- scientific article; zbMATH DE number 2196586 (Why is no real title available?)
- On the positive fragment of the polymodal provability logic GLP
- Strictly positive fragments of the provability logic of Heyting arithmetic
- Kripke completeness of strictly positive modal logics over meet-semilattices with operators
- Axiomatization and polynomial solvability of strictly positive fragments of certain modal logics
- COMPLETE ADDITIVITY AND MODAL INCOMPLETENESS
- scientific article; zbMATH DE number 5046366 (Why is no real title available?)
- On the complexity of the closed fragment of Japaridze's provability logic
- Sufficient conditions for local tabularity of a polymodal logic
- Modal companions of \(K4^+\)
- Decidability of IF modal logic of perfect recall
- PSPACE complexity of modal logic KD45\(_{n}\)
This page was built for publication: PSPACE-decidability of Japaridze's polymodal logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3085172)