Joe Salerno

The paradox of knowability threatens to draw a logical equivalence between the believable claim that all truths are knowable and the obviously false claim that all truths are known. In this paper we evaluate prominent proposals for resolving the paradox of knowability. For instance, we argue that Neil Tennant’s restriction strategy, which aims principally to restrict the main quantifier in ‘all truths are knowable’, does not get to the heart of the problem since there are knowability paradoxes that the restriction does nothing to thwart. We argue that Jon Kvanvig’s strategy, which aims to block the paradox by appealing to the special role of quantified epistemic expressions in modal contexts, has grave errors. We offer here a new proposal founded on Kvanvig’s insight that quantified expressions play a special role in modal contexts. On an articulation of this special role provided by Stanley and Szabo, we propose a solution to the knowability paradoxes. Introduction..

Epistemic modals in consequent place of indicative conditionals give rise to apparent counterexamples to Modus Ponens and Modus Tollens. Familiar assumptions of fa- miliar truth conditional theories of modality facilitate a prima facie explanation—viz., that the target cases harbor epistemic modal equivocations. However, these explana- tions go too far. For they foster other predictions of equivocation in places where in fact there are no equivocations. It is argued here that the key to the solution is to drop the assumption that modal claims are inherently relational (i.e., that they ex- press a logical relation between a prejacent and a premise-set) in favor of a view that treats them as inherently quantificational. In particular it is suggested that modals are mass noun descriptions of information. We demonstrate how this approach unlocks the equivocation problem.