Conglomerability, disintegrability and the comparative principle

Analysis 81 (3):479-488 (2021)
  Copy   BIBTEX

Abstract

Our aim here is to present a result that connects some approaches to justifying countable additivity. This result allows us to better understand the force of a recent argument for countable additivity due to Easwaran. We have two main points. First, Easwaran’s argument in favour of countable additivity should have little persuasive force on those permissive probabilists who have already made their peace with violations of conglomerability. As our result shows, Easwaran’s main premiss – the comparative principle – is strictly stronger than conglomerability. Second, with the connections between the comparative principle and other probabilistic concepts clearly in view, we point out that opponents of countable additivity can still make a case that countable additivity is an arbitrary stopping point between finite and full additivity.

Author Profiles

Rush T. Stewart
King's College London
Michael Nielsen
University of Sydney

Analytics

Added to PP
2021-02-08

Downloads
532 (#29,471)

6 months
137 (#22,584)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?