Defeasibility Conditions and Knowledge

College Depth 72 in the knowledge graph I know this Set as goal
Unlocks 1 downstream topic
defeasibility knowledge justification defeaters

Core Idea

Defeasibility analysis treats knowledge as justified true belief plus conditions on defeaters—reasons that would undermine the justification if added. A belief constitutes knowledge if and only if there exists no undefeated defeater of the belief. This approach formalizes the idea that knowledge is stable under potential challenges.

How It's Best Learned

Understand what counts as a defeater (both rebutting and undercutting) and how defeater chains work. Apply the framework to cases where intuitively we want to say someone lacks knowledge due to an overlooked defeater.

Common Misconceptions

Explainer

You've studied Gettier problems and the various responses epistemologists have proposed — including the "no false lemmas" condition, which rules out knowledge based on reasoning that passes through a false intermediate belief. Defeasibility theory is another response in this tradition, and it generalizes the no-false-lemmas approach into something more comprehensive. The core question it addresses is: what makes knowledge *stable*?

The intuition behind defeasibility analysis is this: genuine knowledge shouldn't be fragile. If you know that there's a sheep in the field, then your belief should be able to survive learning additional true facts about the situation. Imagine you see what looks like a sheep and form the belief that there is a sheep in the field — but unknown to you, what you're seeing is a lifelike stuffed animal, and the real sheep is hidden behind a rock. Your belief is true, it's justified by your visual evidence, and there's no false lemma in your reasoning — yet the truth that you're looking at a decoy would completely undermine your justification if you knew it. That undermining truth is a defeater, and its existence is what separates lucky true belief from genuine knowledge.

Epistemologists distinguish two types of defeaters. A rebutting defeater directly contradicts the belief: evidence that the animal you see is actually a dog in a sheep costume defeats your belief that there's a sheep. An undercutting defeater doesn't contradict the belief but removes the support for it: learning that the field is regularly stocked with lifelike decoys undercuts your visual evidence without directly proving you're wrong. Both types raise the same structural problem — if such a defeater exists in the world, even unbeknownst to you, does that mean you lack knowledge?

The technical formulation answers yes: S knows that P if and only if S's justified true belief that P is indefeasible — there is no true proposition that, if added to S's evidence, would defeat the justification. This elegantly handles Gettier cases by identifying the hidden defeater as the structural flaw. The practical challenge is that this formulation can be very demanding — there may always be some obscure true fact that would technically undermine a justification — which is why defeasibility theorists have spent considerable effort distinguishing genuine defeaters from merely hypothetical or irrelevant ones. The resulting complexity is part of why knowledge analysis has proven so resistant to a clean solution, and why this debate continues to generate new cases and refinements.

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 LogicA Priori and A Posteriori KnowledgeRationalism vs. EmpiricismFoundationalismResponses to External World SkepticismEpistemic ContextualismContextualism and Knowledge AttributionsContextualism as Indexicalism in EpistemologyMargin for Error and Knowledge ConditionsMulti-Case Analysis and Knowledge ConditionsDefeasibility Conditions and Knowledge

Longest path: 73 steps · 398 total prerequisite topics

Prerequisites (5)

Leads To (1)