Loading [MathJax]/extensions/tex2jax.js

Logics with probabilistic team semantics and the Boolean negation.

Publikation: Beitrag in Fachzeitschrift › Artikel › Forschung › Peer-Review

Autorschaft

  • Miika Hannula
  • Minna Hirvonen
  • Juha Kontinen
  • Yasir Mahmood
  • Arne Meier
  • Jonni Virtema

Organisationseinheiten

Externe Organisationen

  • Universität Helsinki
  • Universität Paderborn
  • The University of Sheffield
Plum Print visual indicator of research metrics
  • Mentions
    • News Mentions: 1
see details

Details

OriginalspracheEnglisch
Aufsatznummer3
FachzeitschriftJournal of Logic and Computation
Jahrgang35
Ausgabenummer3
PublikationsstatusVeröffentlicht - 30 März 2025

Abstract

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 first-order theory of random variables with probabilistic independence. We give several results that compare the expressivity of these logics 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.

ASJC Scopus Sachgebiete

Zitieren

Logics with probabilistic team semantics and the Boolean negation. / Hannula, Miika; Hirvonen, Minna; Kontinen, Juha et al.
in: Journal of Logic and Computation, Jahrgang 35, Nr. 3, 3, 30.03.2025.

Publikation: Beitrag in Fachzeitschrift › Artikel › Forschung › Peer-Review

Hannula, M., Hirvonen, M., Kontinen, J., Mahmood, Y., Meier, A., & Virtema, J. (2025). Logics with probabilistic team semantics and the Boolean negation. Journal of Logic and Computation, 35(3), Artikel 3. https://doi.org/10.1093/logcom/exaf021
Hannula M, Hirvonen M, Kontinen J, Mahmood Y, Meier A, Virtema J. Logics with probabilistic team semantics and the Boolean negation. Journal of Logic and Computation. 2025 Mär 30;35(3):3. doi: 10.1093/logcom/exaf021
Hannula, Miika ; Hirvonen, Minna ; Kontinen, Juha et al. / Logics with probabilistic team semantics and the Boolean negation. in: Journal of Logic and Computation. 2025 ; Jahrgang 35, Nr. 3.
Download
@article{0e6aa53c544c4659bb22ce7532366764,
title = "Logics with probabilistic team semantics and the Boolean negation.",
abstract = "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 first-order theory of random variables with probabilistic independence. We give several results that compare the expressivity of these logics 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.",
keywords = "probabilistic team semantics, model checking, satisfiability, validity, computational complexity, expressivity of logics",
author = "Miika Hannula and Minna Hirvonen and Juha Kontinen and Yasir Mahmood and Arne Meier and Jonni Virtema",
note = "Publisher Copyright: {\textcopyright} 2025 The Author(s).",
year = "2025",
month = mar,
day = "30",
doi = "10.1093/logcom/exaf021",
language = "English",
volume = "35",
journal = "Journal of Logic and Computation",
issn = "0955-792X",
publisher = "Oxford University Press",
number = "3",

}

Download

TY - JOUR

T1 - Logics with probabilistic team semantics and the Boolean negation.

AU - Hannula, Miika

AU - Hirvonen, Minna

AU - Kontinen, Juha

AU - Mahmood, Yasir

AU - Meier, Arne

AU - Virtema, Jonni

N1 - Publisher Copyright: © 2025 The Author(s).

PY - 2025/3/30

Y1 - 2025/3/30

N2 - 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 first-order theory of random variables with probabilistic independence. We give several results that compare the expressivity of these logics 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.

AB - 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 first-order theory of random variables with probabilistic independence. We give several results that compare the expressivity of these logics 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.

KW - probabilistic team semantics

KW - model checking

KW - satisfiability

KW - validity

KW - computational complexity

KW - expressivity of logics

UR - http://www.scopus.com/inward/record.url?scp=105004265780&partnerID=8YFLogxK

U2 - 10.1093/logcom/exaf021

DO - 10.1093/logcom/exaf021

M3 - Article

VL - 35

JO - Journal of Logic and Computation

JF - Journal of Logic and Computation

SN - 0955-792X

IS - 3

M1 - 3

ER -

Von denselben Autoren