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

Epistemic Closure and Logical Closure Principles

College Depth 118 in the knowledge graph ☐ I know this ☆ Set as goal
1topic build on this
896prerequisites beneath it
See this on the map →
Epistemic ClosureLogical Form and Argument Patterns+3 more→→Moore's Methods and Responses to Skepticism
closure knowledge logical-properties skepticism

Core Idea

Epistemic closure principles specify how knowledge properties transmit through logical operations. The most discussed principle is closure under known entailment: if you know P and know that P entails Q, you know Q. Skeptical arguments exploit supposed failures of closure to argue that we lack knowledge of ordinary external world propositions. Understanding formal closure principles is essential for assessing these arguments.

Explainer

The intuitive idea behind epistemic closure is that knowledge should be closed under reasoning: if you know something, and you validly reason from it to a conclusion, you should end up knowing the conclusion too. From your study of epistemic closure and logical form, you understand both what closure means informally and how logical entailment works. Closure under known entailment makes this precise: if you know P, and you know that P entails Q, then you know Q. Call this principle "CKE."

CKE seems almost trivially true at first. Suppose you know your car is in the parking lot (P). You know that if your car is in the parking lot, it hasn't been stolen (P entails Q). Surely you know your car hasn't been stolen (Q). But the philosophical action comes from applying CKE to skeptical scenarios. Consider: you know you have hands (P). You know that having hands entails you are not a handless brain in a vat (BIV) being fed false sensory experiences (P entails ~BIV). CKE then says you know you're not a BIV (~BIV). But wait — how could you possibly know you're not a BIV? You can't check from the inside. This creates pressure in both directions. Either you accept that you do know you're not a BIV (Moorean response), or you concede you don't know you're not a BIV and therefore, by reversing CKE, conclude you don't know you have hands (skeptical response).

The formal structure of the skeptical argument is a modus tollens on CKE: if knowing P entails knowing Q (CKE), but you don't know Q (not-BIV), then you don't know P (hands). This is why closure denial is one possible anti-skeptical strategy: philosophers like Fred Dretske and Robert Nozick argued that knowledge does NOT always transmit under known entailment — specifically, "heavyweight" implications like "I'm not a BIV" can be detached from ordinary knowledge without undermining it. On their accounts, you know you have hands through the right perceptual connection to the world, but this doesn't require eliminating remote possibilities like vat scenarios. The tracking theory of knowledge (know P iff you wouldn't believe P if P were false) predicts this: you wouldn't believe you had hands if you didn't have hands (counterfactual tracks), but you might still believe you're not a BIV even if you were one, so you don't "track" that claim.

Closure defenders like John Hawthorne respond that abandoning CKE is too high a price: if you genuinely know P, and you reason validly to Q, it would be epistemically irresponsible to claim you don't know Q. Closure denial also generates odd results — it seems to entail that a competent logician who deduces Q from known premises can know less than a non-logician who never made the deduction. Understanding the formal structure of CKE and its alternatives lets you see that the debate isn't really about closure as an abstract principle — it's about which theory of knowledge best handles the joint demands of ordinary knowledge attribution and skeptical vulnerability. The formal properties of closure (transitivity, whether it holds for disjunctions, whether it applies to single agents or communities) generate a rich technical literature that maps exactly where different theories of knowledge succeed and fail.

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 → Skeptical Scenarios and Knowledge Closure → Epistemic Closure and Logical Closure Principles

Longest path: 119 steps · 896 total prerequisite topics

Prerequisites (5)

Leads To (1)