Probabilities are always axiomatizable

Abstract

In this paper we study the interaction between logic and probability. In particular, we show that the convex hull of evaluations of a broad class of logics is always effectively axiomatizable. We define a Birkhoff-style calculus for probability axioms for which compactness, and finite completeness is proved. We give example for a logic for which probabilities are not finitely axiomatizable.