# Approximation and Dependence via Multiteam Semantics

arXiv: https://arxiv.org/abs/1510.09040 · HTML: https://mlsanity.com/paper/1510.09040/

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 30 Oct 2015.

## Built on by (most cited first, 3 of 3)

- [Formalizing Statistical Causality via Modal Logic](https://mlsanity.com/paper/2210.16751/) (2022)
- [On the Complexity and Properties of Preferential Propositional Dependence Logic](https://mlsanity.com/paper/2505.08522/) (2025)
- [A Primer for Preferential Non-Monotonic Propositional Team Logics](https://mlsanity.com/paper/2405.06973/) (2024)

## Abstract (arXiv)

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 probabilistic versions of inclusion and independence atoms and certain approximation operators motivated by approximate dependence atoms of V"a"an"anen.
