Complexity of finite-variable fragments of products with non-transitive modal logics

DOI10.1093/logcom/exab080OpenAlexW4205130267MaRDI QIDQ5866476

Mikhail Rybakov, Dmitry Shkatov

Publication date: 22 September 2022

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

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

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 (2)

Complexity of finite-variable fragments of propositional temporal and modal logics of computation ⋮ Бинарный предикат, транзитивное замыкание, две-три переменные: сыграем в домино?

This page was built for publication: Complexity of finite-variable fragments of products with non-transitive modal logics