Completeness theorems for σ–additive probabilistic semantics

Completeness theorems for σ–additive probabilistic semantics

We study propositional probabilistic logics (LPP–logics) with probability operators of the form P≥r (“the probability is at least r”) with σ–additive semantics. For regular infinite cardinals κ and λ, the probabilistic logic LPPκ,λ has λ propositional variables, allows conjunctions of...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Annals of pure and applied logic 2020-04, Vol.171 (4), p.102755, Article 102755
Hauptverfasser: Ikodinović, Nebojša, Ognjanović, Zoran, Perović, Aleksandar, Rašković, Miodrag
Format: Artikel
Sprache:eng
Schlagworte:
Completeness
Probability logic
Sigma-additivity
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We study propositional probabilistic logics (LPP–logics) with probability operators of the form P≥r (“the probability is at least r”) with σ–additive semantics. For regular infinite cardinals κ and λ, the probabilistic logic LPPκ,λ has λ propositional variables, allows conjunctions of
ISSN:0168-0072
DOI:10.1016/j.apal.2019.102755