Team semantics is an extension of classical logic where statements do not refer to single
states of a system, but instead to sets of such states, called teams. This kind of semantics …

We establish new, and surprisingly tight, connections between propositional proof
complexity and finite model theory. Specifically, we show that the power of several …

Team semantics is the mathematical basis of modern logics of dependence and
independence. In contrast to classical Tarski semantics, a formula is evaluated not for a …

In this paper, we study several propositional team logics that are closed under unions,
including propositional inclusion logic. We show that all these logics are expressively …

Inclusion logic is a variant of dependence logic that was shown to have the same expressive
power as positive greatest fixed‐point logic. Inclusion logic is not axiomatisable in full, but its …

In team semantics, which is the basis of modern logics of dependence and independence,
formulae are evaluated on sets of assignments, called teams. Multiteam semantics instead …

We study the complexity of reasoning tasks for logics in team semantics. Our main focus is
on the data complexity of model checking but we also derive new results for logically defined …

Team semantics is the mathematical basis of modern logics for reasoning about
dependence and independence. Its core feature is that formulae are evaluated against a set …

Separation logic is a successful logical system for formal reasoning about programs that
mutate their data structures. Team semantics, on the other side, is the basis of modern logics …

The Model-Theoretic Expressiveness of Propositional Proof Systems Page 1 The Model-Theoretic
Expressiveness of Propositional Proof Systems Erich Grädel1, Benedikt Pago2, and Wied …