Complexity of Propositional Logics in Team Semantics
arXiv:1504.06135
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.
15 pages + 1 page appendix, the main result is generalised and the title updated to reflect this