# Logics with probabilistic team semantics and the Boolean negation

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

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 1 Jun 2023.

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

- [On Probabilistic and Causal Reasoning with Summation Operators](https://mlsanity.com/paper/2405.03069/) (2024)

## Abstract (arXiv)

We study the expressivity and the complexity of various logics in probabilistic team semantics with the Boolean negation. In particular, we study the extension of probabilistic independence logic with the Boolean negation, and a recently introduced logic FOPT. We give a comprehensive picture of the relative expressivity of these logics together with the most studied logics in probabilistic team semantics setting, as well as relating their expressivity to a numerical variant of second-order logic. In addition, we introduce novel entropy atoms and show that the extension of first-order logic by entropy atoms subsumes probabilistic independence logic. Finally, we obtain some results on the complexity of model checking, validity, and satisfiability of our logics.