Epistemic closure under deductive inference: what is it and can we afford it?
- Assaf SharonAffiliated withStanford University
- , Levi SpectreAffiliated withThe Open University of Israel Email author
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.Get Access
The idea that knowledge can be extended by inference from what is known seems highly plausible. Yet, as shown by familiar preface paradox and lottery-type cases, the possibility of aggregating uncertainty casts doubt on its tenability. We show that these considerations go much further than previously recognized and significantly restrict the kinds of closure ordinary theories of knowledge can endorse. Meeting the challenge of uncertainty aggregation requires either the restriction of knowledge-extending inferences to single premises, or eliminating epistemic uncertainty in known premises. The first strategy, while effective, retains little of the original idea—conclusions even of modus ponens inferences from known premises are not always known. We then look at the second strategy, inspecting the most elaborate and promising attempt to secure the epistemic role of basic inferences, namely Timothy Williamson’s safety theory of knowledge. We argue that while it indeed has the merit of allowing basic inferences such as modus ponens to extend knowledge, Williamson’s theory faces formidable difficulties. These difficulties, moreover, arise from the very feature responsible for its virtue- the infallibilism of knowledge.
KeywordsKnowledge Inference Modus ponens Infallibilism Lottery propositions Chance Epistemic probability Knowledge safety Single premise closure Multi premise closure
- Epistemic closure under deductive inference: what is it and can we afford it?
Volume 190, Issue 14 , pp 2731-2748
- Cover Date
- Print ISSN
- Online ISSN
- Springer Netherlands
- Additional Links
- Modus ponens
- Lottery propositions
- Epistemic probability
- Knowledge safety
- Single premise closure
- Multi premise closure
- Industry Sectors