{'fraction_non_alphanumeric': 0.021456436931079324, 'fraction_numerical': 0.005201560468140442, 'mean_word_length': 5.180722891566265, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A Decision Theory for Imprecise Credences

Those who model doxastic states with a set of probability functions, rather than a single function, face a pressing challenge: can they provide a plausible decision theory compatible with their view? Adam Elga (2010) and others claim that they cannot, and that the set of functions model should be rejected for this reason. This paper aims to answer this challenge. The key insight is that the set of functions model can be seen as an instance of the supervaluationist approach to vagueness more generally. We can then generate our decision theory by applying the general supervaluationist semantics to decision-theoretic claims. The result: if an action is permissible according to all functions in the set, it’s determinately permissible; if impermissible according to all, determinately impermissible; and – crucially – if permissible according to some, but not all, it’s indeterminate whether it’s permissible. This proposal handles with ease some difficult cases (including one from Elga (2010)) on which alternative decision theories falter. One reason this view has been overlooked in the literature thus far is that all parties to the debate presuppose that an acceptable decision theory must classify each action as either permissible or impermissible. But I will argue that this thought is misguided. Seeing the set of functions model as an instance of supervaluationism provides a compelling motivation for the claim that there can be indeterminacy in the rationality of some actions.