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. (shrink)

In this paper, I propose a solution to Fitch’s paradox that draws on ideas from Edgington (Mind 94:557–568, 1985), Rabinowicz and Segerberg (1994) and Kvanvig (Noûs 29:481–500, 1995). After examining the solution strategies of these authors, I will defend the view, initially proposed by Kvanvig, according to which the derivation of the paradox violates a crucial constraint on quantifier instantiation. The constraint states that non-rigid expressions cannot be substituted into modal positions. We will introduce a slightly modified syntax and semantics (...) that will help underline this point. Furthermore, we will prove results about the consistency of verificationism and the principle of non-omniscience by model-theoretical means. Namely, we prove there exists a model of these principles, and delineate certain constraints they pose on a structure in which they are true. (shrink)

On their alethic reading, formulas,, and codify three of the most basic principles of possibility and its dual. This paper discusses these formulas on a broadly epistemic reading, and in particular as candidate principles about conceivability and its dual. As will be shown, the question whether and its classical dual equivalent, as well as and hold on this reading is not only a logical one but involves a distinctively metaphysical controversy between realist and antirealist views on the relation between truth (...) on the one hand and various cognitive conditions such as knowability, conceivability, and thinkability on the other. It will be argued that the stance we take with regard to the metaphysical dispute has consequences for our assessment of the plausibility not only of and its classical equivalent, but also of and—when that stance is combined with a structural account of propositions—potentially of as well; with all four taken in the above epistemic sense. A second upshot will be that the same sensitivity to metaphysical background commitment also applies to our view as to whether or not inconceivability of the opposite coincides with, or even entails, apriority. (shrink)

Poznawalność jako modalność de re: pewne rozwiązanie paradoksu Fitcha W artykule staramy się znaleźć nowe, intuicyjne rozwiązanie paradoksu Fitcha. Twierdzimy, że tradycyjne wyrażenie zasady poznawalności opiera się na błędnym rozumieniu poznawalności jako modalności de dicto. Zamiast tego proponujemy rozumieć poznawalność jako modalność de re. W artykule przedstawiamy minimalną logikę poznawalności, w której zasada poznawalności jest ważna, ale paradoks Fitcha już nie obowiązuje. Logikę charakteryzujemy semantycznie, a także poprzez podejście aksjomatyczne i tabelaryczne.

(T5) ϕ → ◊Kϕ |-- ϕ → Kϕ where ◊ is possibility, and ‘Kϕ’ is to be read as ϕ is known by someone at some time. Let us call the premise the knowability principle and the conclusion near-omniscience.2 Here is a way of formulating Fitch’s proof of (T5). Suppose the knowability principle is true. Then the following instance of it is true: (p & ~Kp) → ◊K(p & ~Kp). But the consequent is false, it is not possible to know (...) p & ~Kp. That is because the supposition that it is known is provably inconsistent.3 The inconsistency requires us to deny the possibility of the supposition, yielding ~◊K(p & ~Kp). This, together with the above instance of the knowability principle, entails ~(p & ~Kp), which is (classically) equivalent to p → Kp. Since p occurs in none of our undischarged assumptions, we may generalize to get near-omniscience, ϕ → Kϕ. QED. (shrink)

The thesis includes six essays, each corresponding to a chapter, which have the target of widening the discussion on the limits of knowability through the consideration of some general problematics and the discussion of specific topics. The work is composed of two parts, each of three chapters. In the first part, the discussion is focused on a perspective proper of the philosophy of language. In particular, I consider the discussion on the limits of knowability from the point of view of (...) the debate between semantic realism and antirealism. The second part of the thesis is focused on the discussion on the limits of knowability from a perspective more strictly epistemological and proper of the philosophy of science. (shrink)