Modal logics for reasoning about infinite unions and intersections of binary relations

DOI10.1080/11663081.2012.705960zbMath1398.03084OpenAlexW2062671167MaRDI QIDQ4583172

Philippe Balbiani, Natasha Alechina, Dmitry Shkatov

Publication date: 28 August 2018

Published in: Journal of Applied Non-Classical Logics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/11663081.2012.705960

zbMATH Keywords

modal logicfiltrationtableau-based decision proceduresaxiomatic systemsinfinite intersections and unions

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35)

Related Items (1)

Complexity of finite-variable fragments of propositional temporal and modal logics of computation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A guide to completeness and complexity for modal logics of knowledge and belief
• Using resolution for testing modal satisfiability and building models
• Deterministic propositional dynamic logic: finite models, complexity, and completeness
• PDL with intersection of programs: a complete axiomatization
• MAKING SOME ISSUES OF IMPLICIT KNOWLEDGE EXPLICIT
• The Computational Complexity of Provability in Systems of Modal Propositional Logic
• A Modal Perspective on Path Constraints
• Automated Reasoning with Analytic Tableaux and Related Methods

This page was built for publication: Modal logics for reasoning about infinite unions and intersections of binary relations