Online research in philosophy

The paper attempts to give a solution to the Fitch’s paradox though the strategy of the reformulation of the paradox in temporal logic, and a notion of knowledge which is a kind of ceteris paribus modality. An analogous solution has been offered in a different context to solve the problem of metaphysical determinism.

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.

Predicates are term-to-sentence devices, and operators are sentence-to-sentence devices. What Kaplan and Montague's Paradox of the Knower demonstrates is that necessity and other modalities cannot be treated as predicates, consistent with arithmetic; they must be treated as operators instead. Such is the current wisdom.A number of previous pieces have challenged such a view by showing that a predicative treatment of modalities neednot raise the Paradox of the Knower. This paper attempts to challenge the current wisdom in another way as well: to show that mere appeal to modal operators in the sense of sentence-to-sentence devices is insufficient toescape the Paradox of the Knower. A family of systems is outlined in which closed formulae can encode other formulae and in which the diagonal lemma and Paradox of the Knower are thereby demonstrable for operators in this sense.

In this essay I present a new version of the Paradox of the Knower and show that this new paradox vitiates a certain argument against epistemic closure. I then prove a theorem that relates the new paradox to epistemological scepticism. I conclude by assessing the use of the Knower in arguments against syntactical treatments of knowledge.

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.

Graham Priest (1994) has argued that the following paradoxes all have the same structure: Russell’s Paradox, Burali-Forti’s Paradox, Mirimanoff’s Paradox, König’s Paradox, Berry’s Paradox, Richard’s Paradox, the Liar and Liar Chain Paradoxes, the Knower and Knower Chain Paradoxes, and the Heterological Paradox. Their common structure is given by Russell’s Schema: there is a property φ and function δ such that..

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.

A well-known proof by Alonzo Church, first published in 1963 by Frederic Fitch, purports to show that all truths are knowable only if all truths are known. This is the Paradox of Knowability. If we take it, quite plausibly, that we are not omniscient, the proof appears to undermine metaphysical doctrines committed to the knowability of truth, such as semantic anti-realism. Since its rediscovery by Hart and McGinn ( 1976), many solutions to the paradox have been offered. In this article, we present a new proof to the effect that not all truths are knowable, which rests on different assumptions from those of the original argument published by Fitch. We highlight the general form of the knowability paradoxes, and argue that anti-realists who favour either an hierarchical or an intuitionistic approach to the Paradox of Knowability are confronted with a dilemma: they must either give up anti-realism or opt for a highly controversial interpretation of the principle that every truth is knowable.

A variation of Fitch’s Paradox is given, where no special rules of inference are assumed, only axioms. These axioms follow from the familiar assumptions which involve rules of inference. We show (by constructing a model) that by allowing that possibly the knower doesn’t know his own soundness (while still requiring he be sound), Fitch’s Paradox is avoided. Provided one is willing to admit that sound knowers may be ignorant of their own soundness, this might offer a way out of the paradox.

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.