Justification Logic with Confidence

Justification logics are a family of modal logics whose non-normal modalities are parametrised by a type-theoretic calculus of terms. The first justification logic was developed by Sergei Artemov to provide an explicit modal logic for arithmetical provability in which these terms were taken to pick out proofs. But, justification logics have been given various other interpretations as well. In this paper, we will rely on an interpretation in which the modality \ is read ‘S accepts \ as justification for \’. Since it is often important to specify just how much confidence agents have in propositions on the basis of justifications, the logic will need to be extended if it is to provide a sufficiently general account. The primary purpose of this paper is to extend justification logic with the expressive resources to needed to do so. Thus, we will construct the justification logic with confidence ). While \ will be extremely general, capable of accommodating a wide range of interpretations, we provide motivation in terms of the notion of confidence deriving recent work by Paul and Quiggin :363–382, 2018). Under this understanding, confidence must only correspond to a partial ordering. We axiomatise \ and provide a sound and complete semantics.