scientific article
From MaRDI portal
Publication:3647277
zbMath1186.03047MaRDI QIDQ3647277
Publication date: 30 November 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
complexitymodal logicdecision problemsfinite-variable fragmentscomputation tree logicpropositional dynamic logicalternating-time temporal logiclogics of knowledgevariable-free fragments
Analysis of algorithms and problem complexity (68Q25) Modal logic (including the logic of norms) (03B45) Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (4)
Complexity of finite-variable fragments of propositional temporal and modal logics of computation ⋮ Computational complexity of the word problem in modal and Heyting algebras with a small number of generators ⋮ Бинарный предикат, транзитивное замыкание, две-три переменные: сыграем в домино? ⋮ Best unifiers in transitive modal logics
This page was built for publication:
