Abstract
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.
Similar content being viewed by others
References
Berger, J.O. and Wolpert, R.L. (1988). The Likelihood Principle, Institute of Mathematical Statistics.
P. Billingsley (1986) Probability and Measure Wiley New York
S.J. Brams D.M. Kilgour (1995) ArticleTitleThe box problem: To switch or not to switch Mathematics Magazine 68 27–34 Occurrence Handle10.2307/2691373
B. Finetti Particlede (1974) Theory of Probability NumberInSeriesVol. 1 Wiley New York
M. Goldstein J.V. Howard (1991) ArticleTitleA Likelihood Paradox Journal of the Royal Statistical Society. Series B 53 619–628
I.J. Good (1950) Probability and the Weighing of Evidence Griffin London
J.V. Howard (1975) ArticleTitleComputable Explanations Zeitschr. f. math. Logik and Grundlagen d. Math 21 215–224
J. Williamson (1999) ArticleTitleCountable additivity and subjective probability The British Journal for the Philosophy of Science 50 401–416 Occurrence Handle10.1093/bjps/50.3.401
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Howard, J.V. Countable Additivity and the Foundations of Bayesian Statistics. Theor Decis 60, 127–135 (2006). https://doi.org/10.1007/s11238-005-4594-9
Issue Date:
DOI: https://doi.org/10.1007/s11238-005-4594-9