Off-campus access
Using PhilPapers from home?
Click here to configure this browser for off-campus access.
- W. Dean & H. Kurokawa (forthcoming). From the Knowability Paradox to the Existence of Proofs. Synthese.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.
Similar books and articles
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 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..
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 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.
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.
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.
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.
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.
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.
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.
Discussion of W. Dean & H. Kurokawa, From the knowability paradox to the existence of proofs
|
|
There are no threads in this forum |
Nothing in this forum yet.

