David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Synthese 151 (1):81 - 98 (2006)
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.
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
References found in this work BETA
No references found.
Citations of this work BETA
Robert G. Hudson (2009). Faint-Hearted Anti-Realism and Knowability. Philosophia 37 (3):511-523.
Similar books and articles
Julien Murzi (2010). Knowability and Bivalence: Intuitionistic Solutions to the Paradox of Knowability. [REVIEW] Philosophical Studies 149 (2):269 - 281.
Bernhard Weiss (2007). Truth and the Enigma of Knowability. Dialectica 61 (4):521–537.
Rafał Palczewski (2007). Distributed Knowability and Fitch's Paradox. Studia Logica 86 (3):455--478.
Neil Tennant (2001). Is Every Truth Knowable? Reply to Williamson. Ratio 14 (3):263–280.
Jonathan Kvanvig (2009). Restriction Strategies for Knowability : Some Lessons in False Hope. In Joe Salerno (ed.), New Essays on the Knowability Paradox. Oxford University Press.
JC Beall (2000). Fitch's Proof, Verificationism, and the Knower Paradox. Australasian Journal of Philosophy 78 (2):241 – 247.
Berit Brogaard & Joe Salerno (2008). Knowability, Possibility and Paradox. In Vincent Hendricks (ed.), New Waves in Epistemology. Palgrave Macmillan.
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. 339--354.
Salvatore Florio & Julien Murzi (2009). The Paradox of Idealization. Analysis 69 (3):461-469.
Added to index2009-01-28
Total downloads23 ( #79,885 of 1,101,892 )
Recent downloads (6 months)2 ( #191,964 of 1,101,892 )
How can I increase my downloads?