Complexity of Propositional Logics in Team Semantics

TL;DR

This paper classifies the computational complexity of key logical problems in propositional team semantics, revealing they are complete for a high level of exponential-time complexity.

Contribution

It provides a comprehensive complexity classification for satisfiability, validity, and model-checking in propositional team logic, including independence and inclusion logics.

Findings

Satisfiability and validity are complete for alternating exponential-time.

Complexity results apply to propositional independence, inclusion, and team logic.

Main result shows high computational complexity of propositional team logic problems.

Abstract

We classify the computational complexity of the satisfiability, validity and model-checking problems for propositional independence, inclusion, and team logic. Our main result shows that the satisfiability and validity problems for propositional team logic are complete for alternating exponential-time with polynomially many alternations.