Canonical Models and the Complexity of Modal Team Logic

DOI10.4230/LIPIcs.CSL.2018.30OpenAlexW2795570893MaRDI QIDQ5079755

Martin Lück

Publication date: 28 May 2022

Full work available at URL: https://doi.org/10.4230/LIPIcs.CSL.2018.30

zbMATH Keywords

complexitymodal logicsatisfiabilityteam semantics

Mathematics Subject Classification ID

Logic in computer science (03B70)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
• Upwards closed dependencies in team semantics
• A uniform method for proving lower bounds on the computational complexity of logical theories
• On the complexity of the quantified bit-vector arithmetic with binary encoding
• Dependence and independence
• Complexity results for modal dependence logic
• Dependence Logic
• Complexity Hierarchies beyond Elementary
• Complexity of Propositional Independence and Inclusion Logic
• Modal Inclusion Logic: Being Lax is Simpler than Being Strict
• Modal independence logic:
• Model-theoretic and Computational Properties of Modal Dependence Logic
• Alternation
• Compositional semantics for a language of imperfect information
• Complexity of Propositional Logics in Team Semantic
• The Expressive Power of Modal Dependence Logic
• On the complexity of team logic and its two-variable fragment
• The expressive power of modal logic with inclusion atoms
• Validity and entailment in modal and propositional dependence logics
• Model Checking and Validity in Propositional and Modal Inclusion Logics
• Expressivity and Complexity of Dependence Logic
• Axiomatizations for Propositional and Modal Team Logic
• A Van Benthem Theorem for Modal Team Semantics
• The complexity of theorem-proving procedures
• Team Logic and Second-Order Logic

This page was built for publication: Canonical Models and the Complexity of Modal Team Logic