5 papers
Complexity Results in Team Semantics: Nonemptiness Is Not So Complex
Aleksi Anttila, Juha Kontinen, Fan Yang
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 at…
A Deep-Inference Sequent Calculus for Basic Propositional Team Logic (Without Delving Too Deep)
Aleksi Anttila, Rosalie Iemhoff, Fan Yang
We introduce a sequent calculus for the propositional team logic with both the split disjunction and the inquisitive disjunction consisting of a Gentzen-style system (G3-like) for…
Convex Team Logics
Aleksi Anttila, Søren Brinck Knudstorp
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 and and $t…
Bicompleteness Theorems for Team Logics with the Dual Negation
Aleksi Anttila
The dual or game-theoretical negation of independence-friendly logic (IF) and dependence logic (D) exhibits an extreme degree of semantic indeterminacy in that for any pair…
Axiomatizing modal inclusion logic and its variants
Aleksi Anttila, Matilda Häggblom, Fan Yang
We provide a complete axiomatization of modal inclusion logic - team-based modal logic extended with inclusion atoms. We review and refine an expressive completeness and normal for…