Miners and modals

Abstract

I generalise Kolodny and MacFarlane’s miners puzzle by showing epistemic analogues
of their case exist. After motivating various conservative approaches to the original
problem, I show how they fail to solve the problem in its epistemic guise. I argue that a probabilistic
approach to information-sensitivity gives a general solution to the problem.
Keywords: deontic modals, miners puzzle, epistemic ‘should’, probability.