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

DOI10.1093/LOGCOM/EXAB080OpenAlexW4205130267MaRDI QIDQ5866476FDOQ5866476

Authors: 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

Recommendations

• Complexity of products of modal logics
• On the complexity of fragments of modal logics
• Complexity of finite-variable fragments of propositional temporal and modal logics of computation
• Complexity of finite-variable fragments of propositional modal logics of symmetric frames
• Complexity of finite-variable fragments of EXPTIME-complete logics
• Complexity of intuitionistic propositional logic and its fragments
• Non-primitive recursive decidability of products of modal logics with expanding domains
• On the complexity of fragments of the modal logic of Allen's relations over dense structures
• Complexity of a fragment of infinitary action logic with exponential via non-well-founded proofs
• Complexity of intuitionistic and Visser's basic and formal logics in finitely many variables

zbMATH Keywords

computational complexityproducts of modal logicssatisfiability problemfinite-variable fragmentsvalidity problemexpanding relativized products

Mathematics Subject Classification ID

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

Cited In (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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5866476)