Please use this identifier to cite or link to this item:
https://research.matf.bg.ac.rs/handle/123456789/39| Title: | Hierarchies of probabilistic logics | Authors: | Ikodinović, Nebojša Ognjanović, Zoran Perović, Aleksandar Rašković, Miodrag |
Affiliations: | Algebra and Mathematical Logic | Keywords: | Completeness theorems;Definability of probability operators;Hierarchy of probability logics;Probability logic | Issue Date: | 1-Dec-2014 | Journal: | International Journal of Approximate Reasoning | Abstract: | Our 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. |
URI: | https://research.matf.bg.ac.rs/handle/123456789/39 | ISSN: | 0888613X | DOI: | 10.1016/j.ijar.2014.03.006 |
| Appears in Collections: | Research outputs |
Show full item record
SCOPUSTM
Citations
6
checked on Dec 19, 2024
Page view(s)
11
checked on Dec 25, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.