On the logical unsolvability of the Gettier problem

Synthese 142 (1):61 - 79 (2004)
  Copy   BIBTEX

Abstract

The tripartite account of propositional, fallibilist knowledge that p as justified true belief can become adequate only if it can solve the Gettier Problem. However, the latter can be solved only if the problem of a successful coordination of the resources (at least truth and justification) necessary and sufficient to deliver propositional, fallibilist knowledge that p can be solved. In this paper, the coordination problem is proved to be insolvable by showing that it is equivalent to the ''''coordinated attack'''' problem, which is demonstrably insolvable in epistemic logic. It follows that the tripartite account is not merely inadequate as it stands, as proved by Gettier-type counterexamples, but demonstrably irreparable in principle, so that efforts to improve it can never succeed.

Author's Profile

Luciano Floridi
Yale University

Analytics

Added to PP
2009-01-28

Downloads
686 (#28,312)

6 months
130 (#43,410)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?