Deductive Closure and Knowledge

College Depth 77 in the knowledge graph I know this Set as goal
Unlocks 3 downstream topics
knowledge closure deduction entailment

Core Idea

The closure principle asserts that knowledge is closed under known entailment: if you know that P, and you know that P entails Q, then you know Q (at least absent defeating conditions). This principle faces pressure from skeptical scenarios where you know ordinary propositions but arguably don't know skeptical scenarios are false, yet the latter follows from the former. Debates over closure reveal tensions between our intuitions about knowledge and about skepticism.

How It's Best Learned

Test closure with examples: you know your car is in the driveway, you know this entails the driveway exists, so do you know the driveway exists? Examine skeptical challenges to closure and alternative closure principles.

Common Misconceptions

Explainer

From your study of epistemic closure, you have the basic principle in hand: knowledge can "close" under certain operations. Deductive closure makes this precise for the operation of known entailment. The principle says: if you know P, and you know that P entails Q, then you know Q. This seems almost trivially obvious — how could you know a fact and know what follows from it, yet fail to know what follows? If you know the bank is open on Saturday, and you know that "the bank is open on Saturday" entails "the bank is open on some day this weekend," surely you know the bank is open some day this weekend.

The trouble begins when you apply the principle to skeptical scenarios. Here is the standard puzzle. You believe — and seem to know — that you are sitting in a room reading. You also know that "I am sitting in a room reading" entails "I am not a brain in a vat being fed experiences of sitting and reading." By closure, you therefore know that you are not a brain in a vat. But wait: do you actually know that? The whole point of the skeptical scenario is that if you were a brain in a vat, everything would look exactly the same to you. Your evidence does not distinguish between the two situations. Many philosophers, following Descartes, have the strong intuition that you *cannot* know you are not a brain in a vat. But if closure is true, and you *do* know ordinary things, then you must know the skeptical hypothesis is false. Something has to give.

This generates three main responses. Skeptics accept closure and deny that you know ordinary propositions: since you can't know you're not a brain in a vat, you can't know much of anything. Closure deniers (like Dretske and Nozick) reject the closure principle itself — they argue that knowledge requires that your belief *track* the truth in the actual world, and ordinary beliefs can track truth without your belief-forming process being sensitive to exotic skeptical scenarios. On this view, you can know your car is in the driveway without being able to rule out every far-fetched alternative. Contextualists take yet another path: they argue that the word "know" is context-sensitive, and in ordinary conversational contexts the standards are low enough that you know everyday facts, but in skeptical philosophical contexts the standards rise and you no longer "know" anything. None of these responses is without cost, which is what makes deductive closure one of epistemology's central pressure points: it forces you to choose between closure, common-sense knowledge, and the intelligibility of skepticism.

What did you take from this?

Topics in reflective domains aren't scored by quiz answers. Read, reflect, and mark when you've thought it through.

Quiz me anyway →

Prerequisite Chain

Counting to 10Counting to 20Understanding ZeroThe Number ZeroCounting to FiveOne-to-One CorrespondenceCombining Small Groups Within 5Addition Within 10Addition Within 20Two-Digit Addition Without RegroupingTwo-Digit Addition with RegroupingAddition Within 100Repeated Addition as MultiplicationMultiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Two-Digit by One-Digit DivisionDivision with RemaindersRemainders and Quotients in DivisionDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueReading and Writing DecimalsComparing and Ordering DecimalsAdding and Subtracting DecimalsMultiplying DecimalsDividing DecimalsDividing FractionsMixed Number ArithmeticOrder of OperationsInteger Order of OperationsVariable ExpressionsThe Distributive PropertyVariables and Expressions ReviewIntroduction to PolynomialsAdding and Subtracting PolynomialsMultiplying PolynomialsFactorialPermutationsCombinationsCounting Principles: Addition and Multiplication RulesIntroduction to Graph TheoryPropositional Logic FoundationsLogical Inference and Proof RulesProof Strategies in Discrete MathematicsSoundness and Completeness of Propositional LogicSoundness and Completeness of First-Order LogicCompactness Theorem for First-Order LogicBasic Model TheoryLöwenheim-Skolem TheoremsGödel's Incompleteness TheoremsIntroduction to Intuitionistic LogicIntroduction to Modal LogicModal Semantics: Necessity and PossibilityIntensionality and Possible Worlds SemanticsEvent SemanticsAktionsart (Lexical Aspect)Viewpoint Aspect (Perfective and Imperfective)Formal Semantics of Tense and TimeFormal Semantics of Modality and PossibilityPossible Worlds SemanticsModal RealismNecessity and ContingencyThe Modal Status of Identity StatementsModal Semantics and Possible WorldsPossible Worlds Semantics for KnowledgeClosure Principles FormalizedDeductive Closure and Knowledge

Longest path: 78 steps · 527 total prerequisite topics

Prerequisites (3)

Leads To (2)