Journal article
Probabilistic justification logic
- Kokkinis, Ioannis Department of Mathematics, Aristotle University of Thessaloniki, 54124 Thessaloniki, Greece
- Ognjanović, Zoran Mathematical Institute of the Serbian Academy of Sciences and Arts, 11000 Belgrade, Serbia
- Studer, Thomas Institute of Computer Science, University of Bern, 3012 Bern, Switzerland
- 2020-3-2
Published in:
- Journal of Logic and Computation. - Oxford University Press (OUP). - 2020, vol. 30, no. 1, p. 257-280
Theoretical Computer Science
Hardware and Architecture
Logic
Software
Arts and Humanities (miscellaneous)
English
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.
- Language
-
- English
- Open access status
- closed
- Identifiers
-
- DOI 10.1093/logcom/exaa011
- ISSN 0955-792X
- Persistent URL
- https://sonar.ch/global/documents/218125
Statistics
Document views: 18
File downloads: