Epistemic Closure and Epistemological Optimism

Philosophia 49 (1):113-131 (2020)
  Copy   BIBTEX

Abstract

Half a century later, a Dretskean stance on epistemic closure remains a minority view. Why? Mainly because critics have successfully poked holes in the epistemologies on which closure fails. However, none of the familiar pro-closure moves works against the counterexamples on display here. It is argued that these counterexamples pose the following dilemma: either accept that epistemic closure principles are false, and steal the thunder from those who attack classical logic on the basis of similarly problematic cases—specifically, relevance logicians and like-minded philosophers—or stick with closure and surrender to relevantist claims of failure in truth-preservation aimed at classical rules of inference. Classicist closure advocates find the promise of a way out of the dilemma in the works of Roy Sorensen and John Hawthorne. The paper argues against their pro-closure move and renews Robert Audi’s call for a theory of closure-failure.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

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

When does epistemic closure fail?M. Yan - 2013 - Analysis 73 (2):260-264.
Epistemic closure.Peter Baumann - 2011 - In Duncan Pritchard & Sven Bernecker (eds.), The Routledge Companion to Epistemology. Routledge. pp. 597--608.
Ryan on epistemic closure principles.John M. Collins - 2002 - Philosophia 29 (1-4):371-376.
Living without closure.Krista Lawlor - 2005 - Grazer Philosophische Studien 69 (1):25-50.
What We Can Learn from the Skeptical Puzzle.Tim Black - 2009 - Iris. European Journal of Philosophy and Public Debate 1 (2):439-447.
Nozick's defense of closure.Peter Baumann - 2012 - In Kelly Becker & Tim Black (eds.), The Sensitivity Principle in Epistemology. Cambridge University Press. pp. 11--27.
Sensitivity, Safety, and Closure.Sven Bernecker - 2012 - Acta Analytica 27 (4):367-381.
Knowledge and deductive closure.James L. White - 1991 - Synthese 86 (3):409 - 423.

Analytics

Added to PP
2020-05-28

Downloads
64 (#248,320)

6 months
15 (#159,128)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Claudio de Almeida
Pontifícia Universidade Católica Do Rio Grande Do Sul

Citations of this work

Moore′s paradox generalized.Claudio de Almeida - 2022 - Theoria 88 (6):1111-1127.
Getting a little closure for closure.James Simpson - 2021 - Synthese 199 (5-6):12331-12361.

Add more citations

References found in this work

Knowledge and lotteries.John Hawthorne - 2004 - New York: Oxford University Press.
Epistemic operators.Fred I. Dretske - 1970 - Journal of Philosophy 67 (24):1007-1023.

View all 79 references / Add more references