Decidability of predicate logics with team semantics
Logic in Computer Science
2016-06-21 v2 Computational Complexity
Logic
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.
Cite
@article{arxiv.1410.5037,
title = {Decidability of predicate logics with team semantics},
author = {Juha Kontinen and Antti Kuusisto and Jonni Virtema},
journal= {arXiv preprint arXiv:1410.5037},
year = {2016}
}
Comments
Extended version of a MFCS 2016 article. Changes on the earlier arXiv version: title changed, added the result on validity of two-variable dependence logic, restructuring