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

Defeasibility Conditions and Knowledge

College Depth 107 in the knowledge graph ☐ I know this ☆ Set as goal
1topic build on this
735prerequisites beneath it
See this on the map →
The No False Lemmas ConditionMargin for Error and Knowledge Conditions+3 more→→Defeater Networks and Justificatory Stability
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

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 → Foundationalism → Responses to External World Skepticism → Epistemic Contextualism → Contextualism and Knowledge Attributions → The Relevant Alternatives Theory → Contextualism as Indexicalism in Epistemology → Margin for Error and Knowledge Conditions → Multi-Case Analysis and Knowledge Conditions → Defeasibility Conditions and Knowledge

Longest path: 108 steps · 735 total prerequisite topics

Prerequisites (5)

Leads To (1)