Complexity of Propositional Logics in Team Semantics
classification
💻 cs.LO
cs.CCmath.LO
keywords
propositionalteamcomplexitylogicproblemssatisfiabilityvalidityalternating
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.