Accuracy and Probabilism in Infinite Domains

Abstract

The best accuracy arguments for probabilism apply only to credence functions with finite domains, that is, credence functions that assign credence to at most finitely many propositions. This is a significant limitation. It reveals that the support for the accuracy-first programme in epistemology is a lot weaker than it seems at first glance, and it means that accuracy arguments cannot yet accomplish everything that their competitors, the pragmatic (Dutch book) arguments, can. In this paper, I investigate the extent to which this limitation can be overcome. Building on the best arguments in finite domains, I present two accuracy arguments for probabilism that are perfectly general—they apply to credence functions with arbitrary domains. I then discuss how the arguments’ premisses can be challenged. We will see that it is particularly difficult to characterize admissible accuracy measures in infinite domains.