Publication:5465436

zbMath1076.03012MaRDI QIDQ5465436

Mikhail Rybakov, Alexander Chagrov

Publication date: 22 August 2005

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

zbMATH Keywords

computational complexitymodal logicdecision problemone-variable fragmentsvariable-free fragments

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)

Related Items

Modal Logics with Hard Diamond-Free Fragments, Undecidability of QLTL and QCTL with two variables and one monadic predicate letter, Complexity of finite-variable fragments of propositional temporal and modal logics of computation, In all but finitely many possible worlds: model-theoretic investigations on `\textit{overwhelming majority}' default conditionals, Boolean logics with relations, Boolean Logics with Relations, A survey on temporal logics for specifying and verifying real-time systems, Completing the Picture: Complexity of Graded Modal Logics with Converse, Computational complexity of the word problem in modal and Heyting algebras with a small number of generators, Бинарный предикат, транзитивное замыкание, две-три переменные: сыграем в домино?, An NP-complete fragment of fibring logic, On provability logics with linearly ordered modalities, On the complexity of the closed fragment of Japaridze's provability logic, The complexity of identifying characteristic formulae, Parameterized modal satisfiability, The Closed Fragment of IL is PSPACE Hard, Undecidability of first-order modal and intuitionistic logics with two variables and one monadic predicate letter, COMPLETE ADDITIVITY AND MODAL INCOMPLETENESS