A Sound and Complete Calculus for Probability Inequalities

Matthew Doty 📧

February 20, 2023

This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.

Abstract

We give a sound an complete multiple-conclusion calculus $ for finitely additive probability inequalities. In particular, we show Γ$ΦPprobabilities.ϕΦ. PϕγΓ. Pγ ... 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 MaxSAT(Γ @ Φ)+clength ΓPprobabilities.(ϕΦ. Pϕ)+cγΓ. Pγ Finally, we establish a collapse theorem, which asserts that (ϕΦ. Pϕ)+cγΓ. Pγ holds for all probabilities P if and only if (ϕΦ. δϕ)+cγΓ. δγ holds for all binary-valued probabilities δ.

License

BSD License

Topics

Session Probability_Inequality_Completeness