A probabilistic logic between \(LPP_1\) and \(LPP_2\) (Q2169137)

This short paper introduces a logic that sits between LLP\(_1\) and LPP\(_2\) which is called LLP\(_{\frac{3}{2}}\). Background to the two previously introduced logics and the overall approach can be found in [\textit{Z. Ognjanović} et al., Probability logics. Probability-based formalization of uncertain reasoning. Cham: Springer (2016; Zbl 1371.03001)]. The basic logic is in all three cases propositional. Probabilistic operators of the form \(P_{\geq r}\alpha\) are then introduced with the following intended interpretation: the probability of the formula \(\alpha\) is greater or equal than \(r\). The here introduced logic allows for the mixing of classical and probabilistic formulae but does not permit the iteration of probabilistic operators. In this sense, the new logic sits between LLP\(_1\) and LPP\(_2\). After introducing and briefly motivating the logic, the paper gives main characteristics of the new logic: \begin{itemize} \item[1.] LLP\(_{\frac{3}{2}}\) satisfiability problem is NP-complete. \item[2.] An axiomatisation scheme comprising of six axioms and three rules of inference is sound and strongly complete for this logic. \end{itemize}