Yablo's Paradox as a Theorem of Modal Logic

Thomas Forster, Rajeev Goré


We (further) demystify Yablo’s paradox by showing that it can be thought of as the fact that the formula [](p ←→ []¬p) is unsatisfiable in the modal logic KD4 characterised by frames that are strict partial orders without maximal elements. This modal treatment also unifies the two versions of Yablo’s paradox, the original version and its dual.


  • There are currently no refbacks.