Hierarchies of probabilistic logics
We consider probability logics with two types of probability operators. The first type expresses assertions of the form the probability of ? is at least r. The second type expresses assertions of the form the probability of ? is in the set F. We provide a classification of studied logics and show that they form a proper hierarchy.
probability logic completeness theorems definability of probability operators hierarchy of probability logics