Countable Additivity and the Foundations of Bayesian Statistics

At a very fundamental level an individual (or a computer) can process only a finite amount of information in a finite time. We can therefore model the possibilities facing such an observer by a tree with only finitely many arcs leaving each node. There is a natural field of events associated with this tree, and we show that any finitely additive probability measure on this field will also be countably additive. Hence when considering the foundations of Bayesian statistics we may as well assume countable additivity over a σ-field of events. Copyright Springer 2006