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 …

In a modular approach, we lift Hilbert-style proof systems for propositional, modal and first-
order logic to generalized systems for their respective team-based extensions. We obtain …

We provide two proofs of the compactness theorem for extensions of first‐order logic based
on team semantics. First, we build upon Lück's [16] ultraproduct construction for team …

Team semantics is the mathematical framework of modern logics of dependence and
independence in which formulae are interpreted by sets of assignments (teams) instead of …

We study modal team logic MTL, the team-semantical extension of modal logic ML closed
under Boolean negation. Its fragments, such as modal dependence, independence, and …

In this paper, we axiomatize the negatable consequences in dependence and
independence logic by extending the natural deduction systems of the logics given in [10 …

In this paper, we introduce a logic based on team semantics, called FOT, whose expressive
power coincides with first-order logic both on the level of sentences and (open) formulas …

In this paper, we investigate the parameterized complexity of model checking for
Dependence and Independence logic, which are well studied logics in the area of Team …

We study the logic FO (~), the extension of first-order logic with team semantics by
unrestricted Boolean negation. It was recently shown axiomatizable, but otherwise has not …

In this paper, we introduce a logic based on team semantics, called, whose expressive
power is elementary, ie, coincides with first-order logic both on the level of sentences and …