Southern Journal of Philosophy 46 (2):221-44 (2008)
|Abstract||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|
|Through your library||Configure|
Similar books and articles
M. A. Moffett (2002). A Note on the Relationship Between Mates' Puzzle and Frege's Puzzle. Journal of Semantics 19 (2):159-166.
Gregory Wheeler & Pedro Barahona (2012). Why the Hardest Logic Puzzle Ever Cannot Be Solved in Less Than Three Questions. Journal of Philosophical Logic 41 (2):493-503.
Alexander S. Harper (2010). Fallibilism, Contextualism and Second-Order Skepticism. Philosophical Investigations 33 (4):339-359.
Assaf Sharon & Levi Spectre (2010). Dogmatism Repuzzled. Philosophical Studies 148 (2).
John Hawthorne (2004). Knowledge and Lotteries. Oxford University Press.
Tim Black (2008). Defending a Sensitive Neo-Moorean Invariantism. In Vincent Hendricks & Duncan Pritchard (eds.), New Waves in Epistemology. Palgrave Macmillan.
Gabriel Uzquiano (2010). How to Solve the Hardest Logic Puzzle Ever in Two Questions. Analysis 70 (1):39-44.
E. J. Coffman (2008). Warrant Without Truth? Synthese 162 (2):173 - 194.
Brian Rabern & Landon Rabern (2008). A Simple Solution to the Hardest Logic Puzzle Ever. [REVIEW] Analysis 68 (2):105-112.
Added to index2009-01-28
Total downloads27 ( #45,781 of 549,087 )
Recent downloads (6 months)1 ( #63,317 of 549,087 )
How can I increase my downloads?