1. Research with MATF
  2. MATF
  3. Research outputs
Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/39
DC FieldValueLanguage
dc.contributor.authorIkodinović, Nebojšaen_US
dc.contributor.authorOgnjanović, Zoranen_US
dc.contributor.authorPerović, Aleksandaren_US
dc.contributor.authorRašković, Miodragen_US
dc.date.accessioned2022-08-06T15:09:36Z-
dc.date.available2022-08-06T15:09:36Z-
dc.date.issued2014-12-01-
dc.identifier.issn0888613Xen
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/39-
dc.description.abstractOur aim is to present what we call the lower and the upper hierarchy of the real valued probability logics with probability operators of the form P≥s and QF, where s∈[0,1]Q=[0,1] Q and F is a recursive subset of [0,1]Q. The intended meaning of P≥sα is that the probability of α is at least s, while the intended meaning of QFα is that the probability of α is in F.en
dc.relation.ispartofInternational Journal of Approximate Reasoningen_US
dc.subjectCompleteness theoremsen
dc.subjectDefinability of probability operatorsen
dc.subjectHierarchy of probability logicsen
dc.subjectProbability logicen
dc.titleHierarchies of probabilistic logicsen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.ijar.2014.03.006-
dc.identifier.scopus2-s2.0-84908357449-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/84908357449-
dc.contributor.affiliationAlgebra and Mathematical Logicen_US
dc.relation.firstpage1830en_US
dc.relation.lastpage1842en_US
dc.relation.volume55en_US
dc.relation.issue9en_US
item.grantfulltextnone-
item.fulltextNo Fulltext-
item.openairetypeArticle-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
crisitem.author.orcid0000-0003-3832-760X-
Appears in Collections:Research outputs
Show simple item record

SCOPUSTM   
Citations

6
checked on Mar 30, 2025

Page view(s)

11
checked on Jan 19, 2025

Google ScholarTM

Check

Altmetric

Altmetric


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