<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:creator>Kokkinis, Ioannis</dc:creator>
  <dc:creator>Ognjanović, Zoran</dc:creator>
  <dc:creator>Studer, Thomas</dc:creator>
  <dc:date>2020</dc:date>
  <dc:description xmlns:ns0="xml" ns0:lang="en">&lt;jats:title&gt;Abstract&lt;/jats:title&gt;
               &lt;jats:p&gt;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.&lt;/jats:p&gt;</dc:description>
  <dc:identifier>https://sonar.ch/global/documents/218125</dc:identifier>
  <dc:language>eng</dc:language>
  <dc:relation>info:eu-repo/semantics/altIdentifier/doi/10.1093/logcom/exaa011</dc:relation>
  <dc:relation>info:eu-repo/semantics/altIdentifier/issn/0955-792X</dc:relation>
  <dc:source>Journal of Logic and Computation. - Oxford University Press (OUP). - 2020, vol. 30, no. 1, p. 257-280</dc:source>
  <dc:subject xmlns:ns1="xml" ns1:lang="en">Theoretical Computer Science</dc:subject>
  <dc:subject xmlns:ns2="xml" ns2:lang="en">Hardware and Architecture</dc:subject>
  <dc:subject xmlns:ns3="xml" ns3:lang="en">Logic</dc:subject>
  <dc:subject xmlns:ns4="xml" ns4:lang="en">Software</dc:subject>
  <dc:subject xmlns:ns5="xml" ns5:lang="en">Arts and Humanities (miscellaneous)</dc:subject>
  <dc:title xmlns:ns6="xml" ns6:lang="en">Probabilistic justification logic</dc:title>
  <dc:type>http://purl.org/coar/resource_type/c_6501</dc:type>
</oai_dc:dc>