DC FieldValueLanguage
dc.contributor.authorKokkinis, Ioannisen_US
dc.contributor.authorOgnjanović, Zoranen_US
dc.contributor.authorStuder, Thomasen_US
dc.date.accessioned2020-06-03T06:39:55Z-
dc.date.available2020-06-03T06:39:55Z-
dc.date.issued2020-01-23-
dc.identifier.issn0955-792X-
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/2792-
dc.description.abstractWe present a probabilistic justification logic, PPJ⁠, as a framework for uncertain reasoning about rational belief, degrees of belief and justifications. We establish soundness and strong completeness for PPJ with respect to the class of so-called measurable Kripke-like models and show that the satisfiability problem is decidable. We discuss how PPJ provides insight into the well-known lottery paradox.en_US
dc.publisherOxford University Pressen_US
dc.relation.ispartofJournal of Logic and Computationen_US
dc.subjectdecidability | Justification logic | lottery paradox | probabilistic logic | strong completenessen_US
dc.titleProbabilistic justification logicen_US
dc.typeArticleen_US
dc.identifier.doi10.1093/logcom/exaa011-
dc.identifier.scopus2-s2.0-85084139026-
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage257-
dc.relation.lastpage280-
dc.relation.issue1-
dc.relation.volume30-
dc.description.rankM21-
item.cerifentitytypePublications-
item.openairetypeArticle-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.fulltextNo Fulltext-
crisitem.author.orcid0000-0003-2508-6480-
Show simple item record

SCOPUSTM   
Citations

4
checked on May 22, 2024

Page view(s)

68
checked on May 9, 2024

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.