Abstract

Reformulation strategies for solving Fitch’s paradox of knowability date back to Edgington. Their core assumption is that the formula \, from which the paradox originates, does not correctly express the intended meaning of the verification thesis, which should concern possible knowledge of actual truths, and therefore the contradiction does not represent a logical refutation of verificationism. Supporters of these solutions claim that can be reformulated in a way that blocks the derivation of the paradox. Unfortunately, these reformulation proposals come with other problems, on both the logical and the philosophical side. We claim that in order to make the reformulation idea consistent and adequate one should analyze the paradox from the point of view of a quantified modal language. An approach in this line was proposed by, among others, Kvanvig but was not fully developed in its technical details. Here we approach the paradox by means of a first order hybrid modal logic, a tool that strikes us as more adequate to express transworld reference and the rigidification needed to consistently express this idea. The outcome of our analysis is ambivalent. Given a first order formula we are able to express the fact that it is knowable in a way which is both consistent and adequate. However, one must give up the possibility of formulating as a substitution free schema of the kind \. We propose that one may instead formulate by means of a recursive translation of the initial formula, being aware that many alternative translations are possible