A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Deductive Closure and Knowledge

College Depth 116 in the knowledge graph ☐ I know this ☆ Set as goal
3topics build on this
766prerequisites beneath it
See this on the map →
Epistemic ClosureClosure Principles Formalized+1 more→→Epistemic Closure and Logical Closure PrinciplesSkeptical Scenarios and Knowledge Closure
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

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Boolean Algebra → Introduction to Propositional Logic → Introduction to Predicate Logic (First-Order Logic) → First-Order Logic Syntax → Terms and Atomic Formulas in FOL → Variable Binding and Scope → Open and Closed Formulas in First-Order Logic → Variable Substitution and Capture-Avoidance in First-Order Logic → Quantifier Instantiation Rules in First-Order Proof Systems → Universal Quantification: Meaning and Scope → Free Variables and Bound Variables → Substitution and Instantiation in Predicate Logic → Terms and Atomic Formulas → Formulas and Well-Formed Expressions → Structures and Interpretations → Model Interpretation and Satisfaction → Interpretation, Truth, and Satisfaction of Formulas → Logical Consequence and Entailment → Soundness Theorem and Validity of Proof Systems → Deductive Reasoning and Formal Proof Systems → First-Order Resolution → Propositional Resolution → Semantic Tableaux (Propositional) → Semantic Tableaux (First-Order) → Decidable Fragments of First-Order Logic → Gödel's Completeness Theorem for First-Order Logic → Gödel's Incompleteness Theorems → Introduction to Intuitionistic Logic → Introduction to Modal Logic → A Priori and A Posteriori Knowledge → Rationalism vs. Empiricism → The Problem of Induction → Popper's Falsificationism → Falsifiability as the Criterion of Demarcation → The Falsifiability Criterion and Its Problems → Kuhn's Paradigm Theory → Normal Science and Anomalies → Thomas Kuhn and Paradigm Shifts → Scientific Progress and Convergence to Truth → Scientific Realism → Naturalism About Semantic Facts → Propositions and Semantic Content → Truth Conditions and Meaning → Formal Language and Natural Language Semantics → Two-Dimensional Semantics → Modal Semantics and Possible Worlds → Possible Worlds Semantics for Knowledge → Closure Principles Formalized → Deductive Closure and Knowledge

Longest path: 117 steps · 766 total prerequisite topics

Prerequisites (3)

Leads To (2)