Abstract

Some propositions are structurally unknowable for certain agents. Let me call them ‘Moorean propositions’. The structural unknowability of Moorean propositions is normally taken to pave the way towards proving a familiar paradox from epistemic logic—the so-called ‘Knowability Paradox’, or ‘Fitch’s Paradox’—which purports to show that if all truths are knowable, then all truths are in fact known. The present paper explores how to translate Moorean statements into a probabilistic language. A successful translation should enable us to derive a version of Fitch’s Paradox in a probabilistic setting. I offer a suitable schematic form for probabilistic Moorean propositions, as well as a concomitant proof of a probabilistic Knowability Paradox. Moreover, I argue that traditional candidates to play the role of probabilistic Moorean propositions will not do. In particular, we can show that violations of the so-called ‘Reflection Principle’ in probability need not yield structurally unknowable propositions. Among other things, this should lead us to question whether violating the Reflection Principle actually amounts to a clear case of epistemic irrationality, as it is often assumed. This result challenges the importance of the principle as a tool to assess both synchronic and diachronic rationality—a topic which is largely independent of Fitch’s Paradox—from a somewhat unexpected source.