I have argued that without an adequate solution to the knower paradox Fitch's Proof is- or at least ought to be-ineffective against verificationism. Of course, in order to follow my suggestion verificationists must maintain that there is currently no adequate solution to the knower paradox, and that the paradox continues to provide prima facie evidence of inconsistent knowledge. By my lights, any glimpse at the literature on paradoxes offers strong support for the first thesis, and any honest, non-dogmatic reflection on (...) the knower paradox provides strong support for the second. Whether verificationists want to go the route I've suggested is not for me todecide. As in the previous section my aim has been that of defending the mere viability of verificationism in the face of what many, many philosophers have taken to be its death-knell, namely Fitch's Proof. But, as the final objection makes clear, showing that verificationism can live in the face of Fitch's Proof is one thing; showing that it should live is another project. If nothing else, I hope that this papershows that verificationists still have a project to pursue; Fitch's Proof, contrary to popular opinion, need not bury verificationism.13. (shrink)

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

Tr(A) iff ‡K(A) To remedy the error, Dummett’s proposes the following inductive characterization of truth: (i) Tr(A) iff ‡K(A), if A is a basic statement; (ii) Tr(A and B) iff Tr(A) & Tr(B); (iii) Tr(A or B) iff Tr(A) v Tr(B); (iv) Tr(if A, then B) iff (Tr(A) Æ Tr(B)); (v) Tr(it is not the case that A) iff ¬Tr(A), where the logical constant on the right-hand side of each biconditional clause is understood as subject to the laws of intuitionistic (...) logic.2 The only other principle in play in Dummett’s discussion is (+) A iff Tr(A), which, as he notes, the anti-realist is likely to accept. (shrink)

We propose a modal paraconsistent logic sound and complete in order to create a model where the premisses of the knowability paradox are true except the conclusion.

This paper is an attempt to define a new modality with philosophical interest by combining the basic modal ingredients of possibility and knowledge. This combination is realized via product of modal frames so as to construct a knowability modality, which is a bidimensional constructor of arity one defined in a two-dimensional modal frame. A semantical interpretation for the operator is proposed, as well as an axiomatic system able to account for inferences related to this new modality. The resulting logic for (...) knowability LK is shown to be sound and complete with respect to its class of modal-epistemic product models. (shrink)

The intuitionistic conception of truth defended by Dummett, Martin Löf and Prawitz, according to which the notion of proof is conceptually prior1 to the notion of truth, is a particular version of the epistemic conception of truth. The paradox of knowability (first published by Frederic Fitch in 1963) has been described by many authors2 as an argument which threatens the epistemic, and the intuitionistic, conception of truth. In order to establish whether this is really so, one has to understand what (...) the epistemic conception of truth really is. So I shall start inpart I with a description of the matter at issue between theepistemic conception of truth and the opposite position, therealistic conception of truth. Inpart II I shall very briefly describe the paradox. Inpart III I shall try to answer the question which appears in the title of this paper: What can we learn from the paradox of knowability?. My conclusion will be that the paradox of knowability is not a refutation of the epistemic conception of truth, but helps us to better formulate (and understand) such a view. (shrink)

The Knowability Paradox purports to show that the controversial but not patently absurd hypothesis that all truths are knowable entails the implausible conclusion that all truths are known. The notoriety of this argument owes to the negative light it appears to cast on the view that there can be no verification-transcendent truths. We argue that it is overly simplistic to formalize the views of contemporary verificationists like Dummett, Prawitz or Martin-Löf using the sort of propositional modal operators which are employed (...) in the original derivation of the Paradox. Instead we propose that the central tenet of verificationism is most accurately formulated as follows: if is true, then there exists a proof of . Building on the work of Artemov (Bull Symb Log 7(1): 1–36, 2001), a system of explicit modal logic with proof quantifiers is introduced to reason about such statements. When the original reasoning of the Paradox is developed in this setting, we reach not a contradiction, but rather the conclusion that there must exist non-constructed proofs. This outcome is evaluated relative to the controversy between Dummett and Prawitz about proof existence and bivalence. (shrink)

An interesting recent reply to the Paradox of Knowability is Neil Tennant's proposal: to restrict the anti-realist's knowability thesis to truths the knowing of which is logically consistent. However, this proposal is egregiously ad hoc unless motivated by something other than the wish to save anti-realism from embarrassment. We examine Tennant's argument that his restriction is motivated by parallel considerations in cases that are neutral with respect to debates about realism. We conclude that the cases are not neutral, nor the (...) considerations parallel. The failure of Tennant's argument provides an opportunity to reflect on, among other things, the nature of Moore's paradox, and the role of idealization in doxastic logic. (shrink)

Fitch’s paradox shows, from fairly innocent-looking assumptions, that if there are any unknown truths, then there are unknowable truths. This is generally thought to deliver a blow to antirealist positions that imply that all truths are knowable. The present paper argues that a probabilistic version of antirealism escapes Fitch’s result while still offering all that antirealists should care for.

To save antirealism from Fitchs Paradox, Tennant has proposed to restrict the scope of the antirealist principle that all truths are knowable to truths that can be consistently assumed to be known. Although the proposal solves the paradox, it has been accused of doing so in an ad hoc manner. This paper argues that, first, for all Tennant has shown, the accusation is just; second, a restriction of the antirealist principle apparently weaker than Tennants yields a non-ad hoc solution to (...) Fitchs Paradox; and third, the alternative is only apparently weaker than, and even provably equivalent to, Tennants. It is thereby shown that the latter is not ad hoc after all. (shrink)

This paper presents a generalized form of Fitch’s paradox of knowability, with the aim of showing that the questions it raises are not peculiar to the topics of knowledge, belief, or other epistemic notions. Drawing lessons from the generalization, the paper offers a solution to Fitch’s paradox that exploits an understanding of modal talk about what could be known in terms of capacities to know. It is argued that, in rare cases, one might have the capacity to know that p (...) even if it is metaphysically impossible for anyone to know that p , and that recognizing this fact provides the resources to solve Fitch’s paradox. (shrink)

The paradox of knowability and the debate about it are shortly presented. Some assumptions which appear more or less tacitly involved in its discussion are made explicit. They are embedded and integrated in a Russellian framework, where a formal paradox, very similar to the Russell-Myhill paradox, is derived. Its solution is provided within a Russellian formal logic introduced by A. Church. It follows that knowledge should be typed. Some relevant aspects of the typing of knowledge are pointed out.

The so-called knowability paradox results from Fitch's argument that if there are any unknown truths, then there are unknowable truths. This threatens recent versions of semantical antirealism, the central thesis of which is that truth is epistemic. When this is taken to mean that all truths are knowable, antirealism is thus committed to the conclusion that no truths are unknown. The correct antirealistic response to the paradox should be to deny that the fundamental thesis of the epistemic nature of truth (...) entails the knowability of all truths. Correctly understood, the antirealistic conditions on a proposition's truth do not require that the proposition possess a verification-procedure which, when executed under the given conditions, issues in an agent's recognition of truth, but merely that there be a verification-procedure which, under these conditions, takes the value true . The knowability paradox and the related idealism problem (that antirealism seems, but is not, committed to the necessary existence of an epistemic agent) draw attention to the fact that certain propositions, those that are about verification-procedures themselves, may under certain conditions take the value true despite their unperformability under these circumstances. Thus these propositions' procedures can only be performed when the propositions are false, and they gain the appearance of antirealistic impossibility (e.g., that there is an unknown truth). This differs from the unperformability that antirealists object to, pertaining merely to matters of execution rather than to the logical structure of the procedures themselves. The force of antirealism's notion of epistemic truth is piecemeal, rather than consisting in a blanket characterization of truth as knowable. (shrink)

Truth’s universal knowability entails its discovery. This threatens antirealism, which is thought to require it. Fortunately, antirealism is not committed to it. Avoiding it requires adoption (and extension) of Dag Prawitz’s position in his long-term disagreement with Michael Dummett on the notion of provability involved in intuitionism’s identification of it with truth. Antirealism (intuitionism generalized) must accommodate a notion of lost-opportunity truth (a kind of recognition-transcendent truth), and even truth consisting in the presence of unperformable verifications. Dummett’s position cannot abide (...) this, while Prawitz’s can. Antirealism’s epistemic notion of truth derives from general features of its meaning theory, not from a universal knowability principle. (shrink)

It is often claimed that anti-realists are compelled to reject the inference of the knowability paradox, that there are no unknown truths. I call those anti-realists who feel so compelled ‘faint-hearted’, and argue in turn that anti-realists should affirm this inference, if it is to be consistent. A major part of my strategy in defending anti-realism is to formulate an anti-realist definition of truth according to which a statement is true only if it is verified by someone, at some time. (...) I also liberalize what is meant by a verification to allow for indirect forms of verification. From this vantage point, I examine a key objection to anti-realism, that it is committed to the necessary existence of minds, and reject a response to this problem set forth by Michael Hand. In turn I provide a more successful anti-realist response to the necessary minds problem that incorporates what I call an ‘agential’ view of verification. I conclude by considering what intellectual cost there is to being an anti-realist in the sense I am advocating. (shrink)

The Church-Fitch argument, or ‘paradox’ of knowability, apparently shows that, if all truths are knowable, then all truths are known. As some truths are unknown, anti-realists who hold that truths must be knowable have been at pains to block the argument. Here, I consider two such approaches: denying that knowledge distributes over conjunction, and moving to a typed logic. I argue that neither approach works. I first show that a Church-Fitch argument can be run with an assumption weaker than distribution (...) of knowledge over conjunction. I then argue that a modified Church-Fitch argument can be constructed in a typed logic. So neither approach will help those who hold that all truths are knowable. (shrink)

I argue that Fitch’s ‘paradox of knowability’ presents no special problem for the epistemic anti-realist who believes that reality is epistemically accessible to us. For the claim which is the target of the argument (If p then it is possible to know p) is not a commitment of anti-realism. The epistemic anti-realist’s commitment is (or should be) to the recognizability of the states of affairs which render true propositions true, not to the knowability of the propositions themselves. A formal apparatus (...) for discussing the recognizability of states of affairs is offered, and other prima facie similar approaches to the paradox argument are reviewed. (shrink)

Addresses the question of why we find Fitch's knowability 'paradox' argument surprising.

The best defense of the doctrine of the Incarnation implies that traditional Christianity has a special stake in the knowability paradox, a stake not shared by other theistic perspectives or by non-traditional accounts of the Incarnation. Perhaps, this stake is not even shared by antirealism, the view most obviously threatened by the paradox. I argue for these points, concluding that these results put traditional Christianity at a disadvantage compared to other viewpoints, and I close with some comments about the extent (...) of the burden incurred. (shrink)

The knowability paradox derives from a proof by Frederic Fitch in 1963. The proof purportedly shows that if all truths are knowable, it follows that all truths are known. Antirealists, wed as they are to the idea that truth is epistemic, feel threatened by the proof. For what better way to express the epistemic character of truth than to insist that all truths are knowable? Yet, if that insistence logically compels similar assent to some omniscience claim, antirealism is in jeopardy. (...) Response to the paradox has drifted toward a common theme, a theme I will argue is a non-starter in resolving the paradox. Seeing this point will also make clear the philosophical inadequacy of simply viewing the paradox as a refutation of a wide range of antirealisms. (shrink)

There are several things we might mean when we say of someone that he ought to believe a certain claim. We may be speaking of the practical benefits of believing a claim, regardless of the credentials of the claim itself. This is the sense in which we might say, of someone who is depressed when he believes that it is overcast outside, that he ought to believe it is not overcast outside, even if it is in fact overcast and all (...) his evidence points to this conclusion. But we may also explicitly or implicitly set aside practical considerations, and ask what someone ought to believe regardless of the consequences of doing so. (shrink)

Verificationism is the doctrine stating that all truths are knowable. Fitch’s knowability paradox, however, demonstrates that the verificationist claim (all truths are knowable) leads to “epistemic collapse”, i.e., everything which is true is (actually) known. The aim of this article is to investigate whether or not verificationism can be saved from the effects of Fitch’s paradox. First, I will examine different strategies used to resolve Fitch’s paradox, such as Edgington’s and Kvanvig’s modal strategy, Dummett’s and Tennant’s restriction strategy, Beall’s paraconsistent (...) strategy, and Williamson’s intuitionistic strategy. After considering these strategies I will propose a solution that remains within the scope of classical logic. This solution is based on the introduction of a truth operator. Though this solution avoids the shortcomings of the non-standard (intuitionistic) solution, it has its own problems. Truth, on this approach, is not closed under the rule of conjunction-introduction. I will conclude that verificationism is defensible, though only at a rather great expense. (shrink)

In this paper, I focus on some intuitionistic solutions to the Paradox of Knowability. I first consider the relatively little discussed idea that, on an intuitionistic interpretation of the conditional, there is no paradox to start with. I show that this proposal only works if proofs are thought of as tokens, and suggest that anti-realists themselves have good reasons for thinking of proofs as types. In then turn to more standard intuitionistic treatments, as proposed by Timothy Williamson and, most recently, (...) Michael Dummett. Intuitionists can either point out the intuitionistc invalidity of the inference from the claim that all truths are knowable to the insane conclusion that all truths are known, or they can outright demur from asserting the existence of forever-unknown truths, perhaps questioning—as Dummett now suggests—the applicability of the Principle of Bivalence to a certain class of empirical statements. I argue that if intuitionists reject strict finitism—the view that all truths are knowable by beings just like us—the prospects for either proposal look bleak. (shrink)

If proofs are nothing more than truth makers, then there is no force in the standard argument against classical logic (there is no guarantee that there is either a proof forA or a proof fornot A). The standard intuitionistic conception of a mathematical proof is stronger: there are epistemic constraints on proofs. But the idea that proofs must be recognizable as such by us, with our actual capacities, is incompatible with the standard intuitionistic explanations of the meanings of the logical (...) constants. Proofs are to be recognizable in principle, not necessarily in practice, as shown in section 1. Section 2 considers unknowable propositions of the kind involved in Fitch''s paradox:p and it will never be known thatp. It is argued that the intuitionist faces a dilemma: give up strongly entrenched common sense intuitions about such unknowable propositions, or give up verificationism. The third section considers one attempt to save intuitionism while partly giving up verificationism: keep the idea that a proposition is true iff there is a proof (verification) of it, and reject the idea that proofs must be recognizable in principle. It is argued that this move will have the effect that some standard reasons against classical semantics will be effective also against intuitionism. This is the case with Dummett''s meaning theoretical argument. At the same time the basic reason for regarding proofs as more than mere truth makers is lost. (shrink)

Intuitionism’s disagreement with classical logic is standardly based on its specific understanding of truth. But different intuitionists have actually explicated the notion of truth in fundamentally different ways. These are considered systematically and separately, and evaluated critically. It is argued that each account faces difficult problems. They all either have implausible consequences or are viciously circular.

The well-known argument of Frederick Fitch, purporting to show that verificationism (= Truth implies knowability) entails the absurd conclusion that all the truths are known, has been disarmed by Dorothy Edgington''s suggestion that the proper formulation of verificationism presupposes that we make use of anactuality operator along with the standardly invoked epistemic and modal operators. According to her interpretation of verificationism, the actual truth of a proposition implies that it could be known in some possible situation that the proposition holds (...) in theactual situation. Thus, suppose that our object language contains the operatorA — it is actually the case that ... — with the following truth condition: vA iff w0, wherew 0 stands for the designated world of the model — the actual world. Then we can formalize the verificationist claim as follows. (shrink)

According to the “knowability thesis,” every truth is knowable. Fitch’s paradox refutes the knowability thesis by showing that if we are not omniscient, then not only are some truths not known, but there are some truths that are not knowable. In this paper, I propose a weakening of the knowability thesis (which I call the “conjunctive knowability thesis”) to the e:ect that for every truth p there is a collection of truths such that (i) each of them is knowable and (...) (ii) their conjunction is equivalent to p. I show that the conjunctive knowability thesis avoids triviality arguments against it, and that it fares very di:erently depending on another thesis connecting knowledge and possibility. If there are two propositions, inconsistent with one another, but both knowable, then the conjunctive knowability thesis is trivially true. On the other hand, if knowability entails truth, the conjunctive knowability thesis is coherent, but only if the logic of possibility is weak. (shrink)

This paper adds temporal logic to public announcement logic (PAL) and dynamic epistemic logic (DEL). By adding a previous-time operator to PAL, we express in the language statements concerning the muddy children puzzle and sum and product. We also express a true statement that an agent’s beliefs about another agent’s knowledge flipped twice, and use a sound proof system to prove this statement. Adding a next-time operator to PAL, we provide formulas that express that belief revision does not take place (...) in PAL. We also discuss relationships between announcements and the new knowledge agents thus acquire; such relationships are related to learning and to Fitch’s paradox. We also show how inverse programs and hybrid logic each can be used to help determine whether or not an arbitrary structure represents the play of a game. We then add a past-time operator to DEL, and discuss the importance of adding yet another component to the language in order to prove completeness. (shrink)

Michael Dummett’s realism debate is a semantic dispute about the kind of truth conditions had by a given class of sentences. According to his semantic realist, the truth conditions are potentially verification-transcendent in that they may obtain (or not) despite the fact that we may be forever unable to recognize whether they obtain. According to Dummett’s semantic anti-realist, the truth conditions are of a different sort. Essentially, for the anti-realist, that the truth conditions obtain (whenever they do) is a matter (...) that is always recognizable by us in principle. On this view, truth cannot outrun all possible human knowledge. Unsurprisingly, the outcome of the debate is sometimes said to hinge on whether all truths are knowable.1 More carefully the point of contention is the following.. (shrink)