Learn More
In this paper, we introduce a probabilistic justification logic PJ, a logic in which we can reason about the probability of justification statements. We present its syntax and semantics, and establish a strong completeness theorem. Moreover, we investigate the relationship between PJ and the logic of uncertain justifications.
A logic is defined which in addition to propositional calculus contains several types of probabilistic operators which are applied only to propositional formulas. For every s ∈ S, where S is the unit interval of a recursive nonarchimedean field, an unary operator P ≥s (α) and binary operators CP=s(α, β) and CP ≥s (α, β) (with the intended meaning " the(More)