2000 character limit reached
Complexity of Propositional Logics in Team Semantics
Published 23 Apr 2015 in cs.LO, cs.CC, and math.LO | (1504.06135v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
