Hostname: page-component-5c6d5d7d68-sv6ng Total loading time: 0 Render date: 2024-08-08T05:42:51.723Z Has data issue: false hasContentIssue false
  • English
  • Français

Beyond finite additivity

Published online by Cambridge University Press:  02 August 2024

Colin Howson
Colin Howson*
Affiliation:
Professor of Philosophy at the University of Toronto
*
Corresponding author: Peter Urbach; Email: pmurbach@aol.com
Get access Rights & Permissions [Opens in a new window]

Abstract

There is a Dutch Book argument for the axiom of countable additivity for subjective probability functions, but de Finetti famously rejected the axiom, arguing that it wrongly renders a uniform distribution impermissible over a countably infinite lottery. Dubins however showed that rejecting countable additivity has a strongly paradoxical consequence that a much weaker rule than countable additivity blocks. I argue that this rule, which also prohibits the de Finetti lottery, has powerful independent support in a desirable closure principle. I leave it as an open question whether countable additivity should be adopted.

Type
Article
Information
Philosophy of Science , First View , pp. 1 - 10
Copyright
© The Estate of Colin Howson and the Author(s), 2024. Published by Cambridge University Press on behalf of the Philosophy of Science Association

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

This article was written by Colin Howson and submitted to the journal before his death. Peter Urbach graciously agreed to review and assist in the final publication of this article, and to serve as corresponding author during these final stages.

†

Deceased

References

Bell, John L. 2000. “Infinitary Logic.” In the Stanford Encyclopedia of Philosophy, edited by Edward N. Zalta. https://plato.stanford.edu/entries/logic-infinitary/ Google Scholar
Bernstein, Allen R., and Wattenberg, Frank. 1969. “Nonstandard Measure Theory.” In Applications of Model Theory to Algebra, Analysis and Probability, edited by Wilhelmus, A. J. Luxemburg, 171–86. Holt, Rinehart & Winston.Google Scholar
de Finetti, Bruno. 1972. Probability, Induction and Statistics. Wiley.Google Scholar
de Finetti, Bruno. 1974. Theory of Probability, vol. 1. Wiley.Google Scholar
de Finetti, Bruno. 1980 [1937]. “Foresight: Its Logical Laws, Its Subjective Sources”; translated from the French and reprinted in Studies in Subjective Probability, edited by Kyburg and Smokler, 53–11.Google Scholar
Earman, John. 1992. Bayes or Bust? A Critical Examination of Bayesian Confirmation Theory. Cambridge, MA: MIT Press.Google Scholar
Horn, Alfred, and Tarski, Alfred. 1948. “Measures in Boolean Algebras.” Transactions of the American Mathematical Society 64:467–97.CrossRefGoogle Scholar
Howson, Colin. 2014. “Finite Additivity, Another Lottery Paradox and Conditionalisation.” Synthese 191: 989–1012.CrossRefGoogle Scholar
Kadane, Joseph B., and O’Hagan, Anthony. 1995. “Using Finitely Additive Probabilities: Uniform Distributions on the Natural Numbers.” Journal of the American Statistical Association 90:626–31.CrossRefGoogle Scholar
Kadane, Joseph B., Schervish, Mark J., and Seidenfeld, Teddy. 1996. “Reasoning to a Foregone Conclusion.” Journal of the American Statistical Association 91:1228–35.CrossRefGoogle Scholar
Kolmogorov, A. N. 1956 [1933]. Foundations of the Theory of Probability. New York: Chelsea Publishing Company. (English translation of Grundbegriffe der Wahrscheinlichkeitsrechnung, 1933).Google Scholar
Kyburg, Henry E., and Smokler, Howard E., eds. 1980. Studies in Subjective Probability, 2nd ed. Wiley. Google Scholar
McGee, Vann. 2000. “Everything.” In Between Logic and Intuition: Essays in Honor of Charles Parsons, edited by Sher, Gila and Tieszen, Richard, 54–79. Cambridge University Press.CrossRefGoogle Scholar
Pettigrew, Richard. 2016. Accuracy and the Laws of Credence. Oxford University Press.CrossRefGoogle Scholar
Pruss, Alexander R. 2012. “Infinite Lotteries, Perfectly Thin Darts and Infinitesimals.” Thought 1:81–89.Google Scholar
Schervish, Mark J., Seidenfeld, Teddy, and Kadane, Joseph B.. 1984. “The Extent of Non-Conglomerability of Finitely Additive Probabilities.” Zeitschrift für Wahrscheinlichskeitstheorie und verwandte Gebiete 66:205–26.CrossRefGoogle Scholar
Scott, Dana. 1965. “Logic with Denumerably Long Formulas and Finite Strings of Quantifiers.” In Symposium on the Theory of Models, edited by Addison, J.W., Henkin, L., and Tarski, A., 329–41. North Holland.Google Scholar
Trakhtenbrot, Boris A. 1950. “The Impossibility of an Algorithm for the Decidability Problem for Finite Classes.” Proceedings of the USSR Academy of Sciences 70:569–72. (in Russian).Google Scholar
Uffink, Jos. 1996. “The Constraint Rule of the Maximum Entropy Principle.” Studies in History and Philosophy of Modern Physics 27B:47–81.CrossRefGoogle Scholar
van Fraassen, Bas C. 1984. “Belief and the Will.” Journal of Philosophy 81:235–56.CrossRefGoogle Scholar
Villegas, C. 1964. “On Qualitative Probability s-Algebras.” Annals of Mathematical Statistics 35:1787–96.CrossRefGoogle Scholar
Wenmackers, Sylvia, and Horsten, Leon. 2013. “Fair Infinite Lotteries.” Synthese 190:37–61.CrossRefGoogle Scholar