Complexity Results in Team Semantics: Nonemptiness Is Not So Complex
Logic in Computer Science
2026-05-25 v2 Logic
Abstract
We initiate the study of the complexity-theoretic properties of convex logics in team semantics. We focus on the extension of classical propositional logic with the nonemptiness atom NE, a logic known to be both convex and union closed. We show that the satisfiability problem for this logic is NP-complete, that its validity problem is coNP-complete, and that its model-checking problem is in P.
Cite
@article{arxiv.2510.08122,
title = {Complexity Results in Team Semantics: Nonemptiness Is Not So Complex},
author = {Aleksi Anttila and Juha Kontinen and Fan Yang},
journal= {arXiv preprint arXiv:2510.08122},
year = {2026}
}
Comments
14 pages