Southern Journal of Philosophy 46 (2):221-44 (2008)
This paper revisits a puzzle that arises for theories of knowledge according to which one can know on the basis of merely inductive grounds. No matter how strong such theories require inductive grounds to be if a belief based on them is to qualify as knowledge, there are certain beliefs (namely, about the outcome of fair lotteries) that are based on even stronger inductive grounds, while, intuitively, they do not qualify as knowledge. This paper discusses what is often regarded as the most promising classical invariantist solution to the puzzle, namely, that beliefs about the outcomes of fair lotteries do not qualify as knowledge because they are too lucky to do so (or, relatedly, because they do not satisfy a safety condition on knowledge), while other beliefs based on potentially weaker inductive grounds are not too lucky (or, relatedly, because they are safe). A case is presented that shows that this solution to the puzzle is actually not viable. It is argued that there is no obvious alternative solution in sight and that therefore the puzzle still awaits a classical invariantist solution.
|Keywords||Epistemology Modal Epistemology Lotteries Invariantism Puzzle of Fallibilism|
|Categories||categorize this paper)|
References found in this work BETA
Citations of this work BETA
No citations found.
Similar books and articles
How to Solve the Hardest Logic Puzzle Ever in Two Questions.Gabriel Uzquiano - 2010 - Analysis 70 (1):39-44.
Defending a Sensitive Neo-Moorean Invariantism.Tim Black - 2008 - In Vincent Hendricks & Duncan Pritchard (eds.), New Waves in Epistemology. Palgrave-Macmillan. pp. 8--27.
Fallibilism, Contextualism and Second-Order Skepticism.Alexander S. Harper - 2010 - Philosophical Investigations 33 (4):339-359.
Why the Hardest Logic Puzzle Ever Cannot Be Solved in Less Than Three Questions.Gregory Wheeler & Pedro Barahona - 2012 - Journal of Philosophical Logic 41 (2):493-503.
A Note on the Relationship Between Mates' Puzzle and Frege's Puzzle.M. A. Moffett - 2002 - Journal of Semantics 19 (2):159-166.
A Simple Solution to the Hardest Logic Puzzle Ever.Brian Rabern & Landon Rabern - 2008 - Analysis 68 (2):105-112.
Added to index2009-01-28
Total downloads123 ( #39,625 of 2,172,018 )
Recent downloads (6 months)2 ( #173,295 of 2,172,018 )
How can I increase my downloads?