Convex Team Logics

We prove expressive completeness results for convex propositional and modal team logics, where a logic is convex if, for each formula, if it is true in two teams $t$ and $u$ and $t\subseteq s\subseteq u$, then it is also true in $s$. We introduce multiple propositional/modal logics which are expressively complete for the class of all convex propositional/modal team properties. We also answer an open question concerning the expressive power of classical propositional logic extended with the nonemptiness atom NE: we show that it is expressively complete for the class of all convex and union-closed properties. A modal analogue of this result additionally yields an expressive completeness theorem for Aloni's Bilateral State-based Modal Logic. In a specific sense, one of the novel propositional convex logics extends propositional dependence logic and another, propositional inquisitive logic. We generalize the notion of uniform definability, as considered in the team semantics literature, to formalize the notion of extension pertaining to the convex logics.