scientific article

zbMath1244.03073MaRDI QIDQ3085172

Ilya B. Shapirovsky

Publication date: 30 March 2011

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

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)

Related Items (10)

Axiomatization and polynomial solvability of strictly positive fragments of certain modal logics ⋮ AN ESCAPE FROM VARDANYAN’S THEOREM ⋮ Kripke semantics for provability logic GLP ⋮ On the positive fragment of the polymodal provability logic GLP ⋮ Reflection calculus and conservativity spectra ⋮ On the complexity of the closed fragment of Japaridze's provability logic ⋮ KRIPKE COMPLETENESS OF STRICTLY POSITIVE MODAL LOGICS OVER MEET-SEMILATTICES WITH OPERATORS ⋮ COMPLETE ADDITIVITY AND MODAL INCOMPLETENESS ⋮ Modal companions of \(K4^+\) ⋮ MÜNCHHAUSEN PROVABILITY

This page was built for publication: