Approximation and dependence via multiteam semantics

A Durand, M Hannula, J Kontinen, A Meier… - Annals of Mathematics …, 2018 - Springer
We define a variant of team semantics called multiteam semantics based on multisets and
study the properties of various logics in this framework. In particular, we define natural …

Team logic: axioms, expressiveness, complexity

M Lück - 2020 - repo.uni-hannover.de
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 …

[HTML][HTML] Embedding causal team languages into predicate logic

F Barbero, P Galliani - Annals of Pure and Applied Logic, 2022 - Elsevier
Abstract Causal team semantics ([2]) supports causal-observational languages, which
enrich the languages for deterministic causation ([11],[18]) with dependencies and other …

Polyteam semantics

M Hannula, J Kontinen, J Virtema - Journal of Logic and …, 2020 - academic.oup.com
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 …

Counting of teams in first-order team logics

A Haak, J Kontinen, F Müller, H Vollmer… - arXiv preprint arXiv …, 2019 - arxiv.org
We study descriptive complexity of counting complexity classes in the range from# P to#
$\cdot $ NP. A corollary of Fagin's characterization of NP by existential second-order logic is …

Tractability frontier of data complexity in team semantics

A Durand, J Kontinen, N de Rugy-Altherre… - ACM Transactions on …, 2021 - dl.acm.org
We study the data complexity of model checking for logics with team semantics. We focus on
dependence, inclusion, and independence logic formulas under both strict and lax team …

On the complexity of team logic and its two-variable fragment

M Lück - arXiv preprint arXiv:1804.04968, 2018 - arxiv.org
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 …

Characterizing downwards closed, strongly first-order, relativizable dependencies

P Galliani - The Journal of Symbolic Logic, 2019 - cambridge.org
In Team Semantics, a dependency notion is strongly first order if every sentence of the logic
obtained by adding the corresponding atoms to First-Order Logic is equivalent to some first …

Doubly strongly first order dependencies

P Galliani - Logic, Language, Information, and Computation: 27th …, 2021 - Springer
Team Semantics is a generalization of Tarskian Semantics that can be used to add to First
Order Logic atoms and connectives expressing dependencies between the possible values …

Characterizing strongly first order dependencies: the non-jumping relativizable case

P Galliani - arXiv preprint arXiv:1902.07794, 2019 - arxiv.org
Team Semantics generalizes Tarski's Semantics for First Order Logic by allowing formulas to
be satisfied or not satisfied by sets of assignments rather than by single assignments …