scientific article; zbMATH DE number 1123884

From MaRDI portal
Publication:4378240





The authors give a survey of a number of propositional probabilistic logics that are conservative extensions of classical propositional logic. These logics allow statements such as ``if \(\alpha \) holds with probability \(s\), and \(\beta \) follows from \(\alpha \) with probability \(t\), then the probability of \(\beta \) is \(r\). The formulas \(\alpha \) and \(\beta \) are either true or false, and have no numerical value. The authors discuss finiteness, completeness, compactness, and decidability of the logics considered. Two kinds of probabilistic logics are constructed: in the first kind there is no iteration of probabilistic operators and in the second there is one. Two kinds of models are considered: in the first kind there are probabilistic measures with finite ranges only and in the second kind probabilistic measures are arbitrary. Compactness holds only for probabilistic logics having models with a fixed finite range of measures. The finiteness property can be obtained as a consequence of the Archimedean axiom for the reals and a fixed finite range of measures.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4378240)