Abstract
We give a sound an complete multiple-conclusion calculus for finitely additive probability inequalities. In particular, we show
... where is the negation of all of the formulae in (and similarly for ). We prove this by using an abstract form of MaxSAT. We also show
Finally, we establish a collapse theorem, which asserts that holds for all probabilities if and only if holds for all binary-valued probabilities .
License
Topics
- Mathematics/Probability theory
- Logic/General logic/Classical propositional logic
- Logic/General logic