Modal Inclusion Logic: Being Lax is Simpler than Being Strict

DOI10.1007/978-3-662-48057-1_22zbMath1465.68105OpenAlexW1901350436WikidataQ57998287 ScholiaQ57998287MaRDI QIDQ2946343

Arne Meier, Heribert Vollmer, Lauri Hella, Antti Kuusisto

Publication date: 16 September 2015

Published in: Mathematical Foundations of Computer Science 2015 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48057-1_22

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

Axiomatizations of team logics ⋮ Complexity of Propositional Independence and Inclusion Logic ⋮ Modal Inclusion Logic: Being Lax is Simpler than Being Strict ⋮ The expressive power of modal logic with inclusion atoms ⋮ Unnamed Item ⋮ LOGICS FOR PROPOSITIONAL DETERMINACY AND INDEPENDENCE ⋮ Expressivity and Complexity of Dependence Logic ⋮ Canonical Models and the Complexity of Modal Team Logic ⋮ Unnamed Item ⋮ Model Checking and Validity in Propositional and Modal Inclusion Logics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
• The price of universality
• Complexity of the two-variable fragment with counting quantifiers
• Modal Inclusion Logic: Being Lax is Simpler than Being Strict
• Hierarchies in independence logic
• Model-theoretic and Computational Properties of Modal Dependence Logic
• The Computational Complexity of Provability in Systems of Modal Propositional Logic
• Dynamic Epistemic Logics
• Lower bounds for multiplayer noncooperative games of incomplete information