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

The No False Lemmas Condition

College Depth 89 in the knowledge graph ☐ I know this ☆ Set as goal
2topics build on this
473prerequisites beneath it
See this on the map →
Gettier Cases and Formal Analysis→→Defeasibility Conditions and Knowledge
gettier responses knowledge false-lemmas

Core Idea

The no false lemmas condition, developed by Lehrer and others, proposes that knowledge requires not only justified true belief but also that the belief not be based on any false lemmas or false intermediate steps. This condition aims to eliminate Gettier cases by excluding inferences that depend crucially on falsehoods, even if those falsehoods don't directly appear in the justification.

Explainer

From your formal analysis of Gettier cases, you know the problem: there are situations where a person has a true, justified belief that nonetheless seems not to count as knowledge, because the route from justification to truth runs through luck. The challenge is to identify exactly what extra ingredient knowledge requires beyond JTB. The no false lemmas condition is one of the earliest and most intuitive proposals: knowledge fails whenever the inferential path from justification to belief passes through a false intermediate step, even if the final belief is true.

Consider the canonical Gettier-style case. Smith justifiably believes "Jones owns a Ford" (perhaps Jones drives one, has always owned one, etc.). From this, Smith infers "Either Jones owns a Ford, or Brown is in Barcelona" — a true disjunction, formed by adding a random second disjunct. As it happens, Jones does not own a Ford, but Brown genuinely is in Barcelona. So Smith has a justified true belief in the disjunction, but it seems wrong to say he *knows* it. The no false lemmas diagnosis: Smith's inference ran through the false lemma "Jones owns a Ford." Because that lemma is false, the epistemic connection between Smith's justification and the true conclusion is broken — the truth of the conclusion is accidental relative to his evidence.

The condition can be stated formally: S knows that p if and only if (i) p is true, (ii) S believes that p, (iii) S is justified in believing p, and (iv) S's justification does not essentially depend on any false lemma — that is, there is no false proposition q such that S's belief that p is inferred (explicitly or implicitly) from q. Condition (iv) is the addition. It targets the structure of inferential chains: even if the final product is true, if the chain passed through a falsehood, the inference is epistemically tainted.

The condition handles many Gettier cases cleanly and has a strong intuitive motivation: falsehoods in an inference are like forged links in a chain — the chain still holds the weight, but by luck rather than by its actual structure. However, the condition runs into counterexamples from the other direction. Some Gettier cases appear not to involve any false lemma: perception-based cases where you form a belief directly from a reliable perceptual process, without any inferential chain at all, can still generate Gettier-like luck. If you perceive a barn while driving through a region full of convincing barn facades (and you happen to be looking at the one real barn), your perceptual belief has no inferential lemmas — yet many philosophers judge it not to count as knowledge. No false lemmas cannot diagnose this case, because there are no lemmas at all.

This limitation motivates the move to defeasibility conditions — the next development in this line of thought. Instead of asking whether the inferential chain contains falsehoods, defeasibility approaches ask whether the justification would survive the addition of true information. The no false lemmas condition is, in effect, a special case of defeasibility: a false lemma is one salient way a justification can be defeated. But not all defeaters are false lemmas, and tracking that fuller space of potential defeaters requires a more general framework.

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 → Syntactic Consequence (⊢) Versus Semantic Consequence (⊨) → Logical Consequence and Validity → Gettier Cases and Formal Analysis → The No False Lemmas Condition

Longest path: 90 steps · 473 total prerequisite topics

Prerequisites (1)

Leads To (1)