Complexity of finite-variable fragments of products with K

DOI10.1093/logcom/exaa060OpenAlexW3093927345MaRDI QIDQ5858128

Dmitry Shkatov, Mikhail Rybakov

Publication date: 9 April 2021

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exaa060

zbMATH Keywords

computational complexitysatisfiability problemfinite-variable fragmentsproducts of modal logicsvalidity problemexpanding relativized products

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Related Items (4)

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 of finite-variable fragments of products with K