Off-campus access
Using PhilPapers from home?
Click here to configure this browser for off-campus access.
- Greg Restall (2009). Not Every Truth Can Be Known (at Least, Not All at Once). In Joe Salerno (ed.), New Essays on the Knowability Paradox. Oxford University Press.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.
Similar books and articles
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..
Since its disc overy by Fitch, the paradox of knowability has been a thorn in the anti-realist's side. Recently both Dummett and Tennant have sought to relieve the anti-realist by restricting the applicability of the knowability principle -- the principle that all truths are knowable -- which has been viewed as both a cardinal doctrine of anti-realism and the assumption for reductio of Fitch's argument. In this paper it is argued that the paradox of knowability is a peculiarly acute manifestation of a syndrome affecting anti-realism, against which Dummett's and Tennant's manoeuvres are not finally efficacious. The anti-realist can only cope with the syndrome by being much clearer about her notion of knowability. In fact, she'll have to offer an account which relativises the notion of knowability both to the world at which knowability is assessed and to the content of the proposition to which it is applied. This is not, however, merely an ad hoc manoeuvre to counter the problematic syndrome; rather it is just what we should expect from the anti-realist's intuitive use of the notion. A preliminary investigation indicates that there is no way of providing a general, systematic explanation of such a notion of knowability and thus an inherent restriction on the principle of knowability -- but one differing from those offered by either Dummett or Tennant -- is developed.
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.
The knowability paradox threatens metaphysical or semantical antirealism, the view that truth is epistemic, by revealing an awful consequence of the claim [i] that all truths are knowable. Various attempts have been made to find a way out of the paradox.
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.
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.
(PDF of penultimate draft; please don’t quote from or cite this version.) Forthcoming in Synthese. Generalizations of Fitch’s paradox of knowability motivate the thesis that in saying that a truth is knowable, or that it could be known, we do not mean that it is possible that it is known. Instead, I argue, claims about knowability express capacities to know. The paper concludes by explaining the requisite sense of “capacity” at work here, and by showing how the paradox of knowability and its generalizations are solved.
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.
The paradox of knowability is a logical result suggesting that, necessarily, if all truths are knowable in principle then all truths are in fact known. The contrapositive of the result says, necessarily, if in fact there is an unknown truth, then there is a truth that couldn't possibly be known. More specifically, if p is a truth that is never known then it is unknowable that p is a truth that is never known. The proof has been used to argue against versions of anti-realism committed to the thesis that all truths are knowable. For clearly there are unknown truths; individually and collectively we are non-omniscient. So, by the main result, it is false that all truths are knowable. The result has also been used to draw more general lessons about the limits of human knowledge. Still others have taken the proof to be fallacious, since it collapses an apparently moderate brand of anti-realism into an obviously implausible and naive idealism.
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.
Discussion of Greg Restall, Not every truth can be known (at least, not all at once)
|
|
There are no threads in this forum |
Nothing in this forum yet.

