PSPACE-decidability of Japaridze's polymodal logic

MaRDI QIDQ3085172zbMATHFDO

Authors Ilya Shapirovsky

Publication date 30 March 2011

zbMATH Keywords

computational complexityconditional satisfiabilityJaparidze's polymodal logic

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)

Recommendations

• scientific article; zbMATH DE number 5046366
• On the complexity of the closed fragment of Japaridze's provability logic
• scientific article; zbMATH DE number 2020142
• Decidability of IF modal logic of perfect recall
• scientific article; zbMATH DE number 1989649

Cited in

(17)

• Kripke completeness of strictly positive modal logics over meet-semilattices with operators
• scientific article; zbMATH DE number 2196586 (Why is no real title available?)
• Reflection calculus and conservativity spectra
• PSPACE complexity of modal logic KD45\(_{n}\)
• scientific article; zbMATH DE number 2020142 (Why is no real title available?)
• Decidability of IF modal logic of perfect recall
• Modal companions of \(K4^+\)
• PSPACE bounds for rank-1 modal logics
• COMPLETE ADDITIVITY AND MODAL INCOMPLETENESS
• On the positive fragment of the polymodal provability logic GLP
• AN ESCAPE FROM VARDANYAN’S THEOREM
• On the complexity of the closed fragment of Japaridze's provability logic
• scientific article; zbMATH DE number 5046366 (Why is no real title available?)
• On provability logics of Niebergall arithmetic
• Kripke semantics for provability logic GLP
• Axiomatization and polynomial solvability of strictly positive fragments of certain modal logics
• MÜNCHHAUSEN PROVABILITY

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)