Complexity and expressivity of branching- and alternating-time temporal logics with finitely many variables

DOI10.1007/978-3-030-02508-3_21OpenAlexW2896904638MaRDI QIDQ1623150

Dmitry Shkatov, Mikhail Rybakov

Publication date: 23 November 2018

Full work available at URL: https://arxiv.org/abs/1810.09142

zbMATH Keywords

computational complexitysatisfiability problemfinite-variable fragmentsbranching-time temporal logicsalternating-time temporal logicssemantic expressivity

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (3)

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 ⋮ Computational complexity of the word problem in modal and Heyting algebras with a small number of generators

This page was built for publication: Complexity and expressivity of branching- and alternating-time temporal logics with finitely many variables