Some considerations on the logics PFD A logic combining modality and probability

From MaRDI portal
Publication:4354625





The logic \(P_FD\), introduced by \textit{M. Fattorosi-Barnaba} and \textit{G. Amati} [Stud. Log. 46, 383-393 (1987; Zbl 0645.03016)], based on the propositional language enriched with a family of modal (probability) operators enabling to express the statement that ``the probability of a formula is greater than \(r(\in[0,1])\), presents an extension of classical propositional calculus by axioms concerning those probability operators. In this paper, a Kripke-type semantics for \(P_FD\) is developed, including the completeness result, followed by the finite model property and decidability of \(P_FD\) by using the filtration technique. At the end of the paper some interesting conclusions and alternatives for further research are considered.











This page was built for publication: Some considerations on the logics PFD A logic combining modality and probability

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