Probabilistic justification logic
Keyword(s):
Abstract We present a probabilistic justification logic, $\mathsf{PPJ}$, as a framework for uncertain reasoning about rational belief, degrees of belief and justifications. We establish soundness and strong completeness for $\mathsf{PPJ}$ with respect to the class of so-called measurable Kripke-like models and show that the satisfiability problem is decidable. We discuss how $\mathsf{PPJ}$ provides insight into the well-known lottery paradox.
1983 ◽
Vol 6
(2)
◽
pp. 231-245
◽
Keyword(s):
Keyword(s):
1966 ◽
Vol 24
◽
pp. 322-330