Everything is Knowable – How to Get to Know Whether a Proposition is True

Theoria 78 (2):93-114 (2012)
  Copy   BIBTEX

Abstract

Fitch showed that not every true proposition can be known in due time; in other words, that not every proposition is knowable. Moore showed that certain propositions cannot be consistently believed. A more recent dynamic phrasing of Moore-sentences is that not all propositions are known after their announcement, i.e., not every proposition is successful. Fitch's and Moore's results are related, as they equally apply to standard notions of knowledge and belief (S 5 and KD45, respectively). If we interpret ‘successful’ as ‘known after its announcement’ and ‘knowable’ as ‘known after some announcement’, successful implies knowable. Knowable does not imply successful: there is a proposition ϕ that is not known after its announcement but there is another announcement after which ϕ is known. We show that all propositions are knowable in the more general sense that for each proposition, it can become known or its negation can become known. We can get to know whether it is true: ◊(Kϕ ∨ K¬ϕ). This result comes at a price. We cannot get to know whether the proposition was true. This restricts the philosophical relevance of interpreting ‘knowable’ as ‘known after an announcement’

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 104,766

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Everything is learnable, once it is settled.Kevin Xu - 2021 - Synthese 199 (1-2):4795-4817.
Not every truth can be known (at least, not all at once).Greg Restall - 2008 - In Joe Salerno, New Essays on the Knowability Paradox. Oxford, England and New York, NY, USA: Oxford University Press. pp. 339--354.
Not every truth can be known (at least, not all at once).Greg Restall - 2008 - In Joe Salerno, New Essays on the Knowability Paradox. Oxford, England and New York, NY, USA: Oxford University Press. pp. 339--354.
Perfected Science and the Knowability Paradox.Massimiliano Carrara & Davide Fassio - 2010 - In M. M. D’Agostino, G. Giorello, F. Laudisa, T. Pievani & C. Sinigaglia, New Essays in Logic and Philosophy of Science. London College Publications.
Frederic Fitch and Epistemic Blindspotting.Osbert Jian Kang - 1990 - Dissertation, University of Calgary (Canada)
Victor vanquished.Neil Tennant - 2002 - Analysis 62 (2):135-142.

Analytics

Added to PP
2011-10-22

Downloads
129 (#178,435)

6 months
5 (#868,391)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Wiebe Van Der Hoek
University of Liverpool