2000 character limit reached
Decidability of predicate logics with team semantics (1410.5037v2)
Published 19 Oct 2014 in cs.LO, cs.CC, and math.LO
Abstract: We study the complexity of predicate logics based on team semantics. We show that the satisfiability problems of two-variable independence logic and inclusion logic are both NEXPTIME-complete. Furthermore, we show that the validity problem of two-variable dependence logic is undecidable, thereby solving an open problem from the team semantics literature. We also briefly analyse the complexity of the Bernays-Sch\"onfinkel-Ramsey prefix classes of dependence logic.