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 moreMoore'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 ZeroThe Number ZeroCounting to FiveCounting to 10Counting to 20Counting a Set of Objects Up to 20Cardinality: The Last Number CountedMatching Numerals to QuantitiesSubitizing Small QuantitiesAddition Within 10Number Bonds to 10Addition Within 20Doubles and Near DoublesDoubles Facts Within 10Near Doubles Facts Within 20Mental Math Strategies for AdditionMental Math: Adding and Subtracting TensAddition Within 100Repeated Addition as MultiplicationMultiplication as Equal GroupsMultiplication: ArraysBasic Multiplication Facts (0s, 1s, 2s, 5s, 10s)Multiplication 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 100Multiplication and Division Fact FamiliesRelationship Between Multiplication and DivisionDivision Facts as Inverse of MultiplicationRemainders and Quotients in DivisionDivision Word ProblemsMulti-Step Word ProblemsSolving Multi-Step Word ProblemsMultiplication Word ProblemsDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineComparing and Ordering IntegersAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersIntroduction to ExponentsOrder 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 EquivalencesBoolean AlgebraIntroduction to Propositional LogicIntroduction to Predicate Logic (First-Order Logic)First-Order Logic SyntaxTerms and Atomic Formulas in FOLVariable Binding and ScopeOpen and Closed Formulas in First-Order LogicVariable Substitution and Capture-Avoidance in First-Order LogicQuantifier Instantiation Rules in First-Order Proof SystemsUniversal Quantification: Meaning and ScopeFree Variables and Bound VariablesSubstitution and Instantiation in Predicate LogicTerms and Atomic FormulasFormulas and Well-Formed ExpressionsStructures and InterpretationsModel Interpretation and SatisfactionInterpretation, Truth, and Satisfaction of FormulasLogical Consequence and EntailmentSoundness Theorem and Validity of Proof SystemsDeductive Reasoning and Formal Proof SystemsFirst-Order ResolutionPropositional ResolutionSemantic Tableaux (Propositional)Semantic Tableaux (First-Order)Decidable Fragments of First-Order LogicGödel's Completeness Theorem for First-Order LogicGödel's Incompleteness TheoremsIntroduction to Intuitionistic LogicIntroduction to Modal LogicA Priori and A Posteriori KnowledgeRationalism vs. EmpiricismThe Problem of InductionPopper's FalsificationismFalsifiability as the Criterion of DemarcationThe Falsifiability Criterion and Its ProblemsKuhn's Paradigm TheoryNormal Science and AnomaliesThomas Kuhn and Paradigm ShiftsScientific Progress and Convergence to TruthScientific RealismNaturalism About Semantic FactsPropositions and Semantic ContentTruth Conditions and MeaningFormal Language and Natural Language SemanticsTwo-Dimensional SemanticsModal Semantics and Possible WorldsPossible Worlds Semantics for KnowledgeClosure Principles FormalizedDeductive Closure and KnowledgeSkeptical Scenarios and Knowledge ClosureEpistemic Closure and Logical Closure Principles

Longest path: 119 steps · 896 total prerequisite topics

Prerequisites (5)

Leads To (1)