PSPACE-decidability of Japaridze's polymodal logic

zbMATH Open1244.03073MaRDI QIDQ3085172FDOQ3085172

Authors: Ilya Shapirovsky 

Publication date: 30 March 2011

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

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)

Cited In (17)

• MÜNCHHAUSEN PROVABILITY
• AN ESCAPE FROM VARDANYAN’S THEOREM
• Kripke semantics for provability logic GLP
• PSPACE bounds for rank-1 modal logics
• On provability logics of Niebergall arithmetic
• Reflection calculus and conservativity spectra
• KRIPKE COMPLETENESS OF STRICTLY POSITIVE MODAL LOGICS OVER MEET-SEMILATTICES WITH OPERATORS
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the positive fragment of the polymodal provability logic GLP
• COMPLETE ADDITIVITY AND MODAL INCOMPLETENESS
• Axiomatization and polynomial solvability of strictly positive fragments of certain modal logics
• Title not available (Why is that?)
• On the complexity of the closed fragment of Japaridze's provability logic
• Decidability of IF modal logic of perfect recall
• Modal companions of \(K4^+\)
• 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)