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

Gettier Problems

College Depth 83 in the knowledge graph ☐ I know this ☆ Set as goal
53topics build on this
440prerequisites beneath it
See this on the map →
The Counterexample MethodThe Justified True Belief Account of Knowledge→→Epistemic Defeat: Defeaters and UndercuttersEpistemic Luck+5 more
Gettier counterexample JTB luck knowledge-analysis

Core Idea

In a three-page 1963 paper, Edmund Gettier refuted the JTB analysis by constructing cases where an agent has justified true belief but intuitively lacks knowledge. In one case, Smith justifiably believes Jones will get the job and has ten coins in his pocket; Smith also (unknowingly) has ten coins in his own pocket. Smith infers 'the man who will get the job has ten coins in his pocket' — a belief that turns out true, but for the wrong reason, since Smith himself gets the job. Such Gettier cases share a structure: justification is present, truth is present, belief is present, yet knowledge seems absent because the truth and justification are connected only by accident.

How It's Best Learned

Construct several Gettier cases yourself, trying to vary the structure. Identify what each case has in common: the belief is justified by evidence that fails to track the actual truth-maker. Then ask what additional condition, if added to JTB, would block all such cases.

Common Misconceptions

Explainer

You already know that the justified true belief (JTB) analysis proposes three necessary and jointly sufficient conditions for knowledge: you know that P if and only if you believe P, P is true, and your belief is justified. This seemed to capture what knowledge is — not lucky guessing (you need justification), not false belief (you need truth), not mere inclination (you need actual belief). Gettier's 1963 paper showed in three pages that the analysis is wrong, and it changed epistemology permanently.

The key to understanding Gettier cases is the accidental connection between justification and truth. In standard cases of knowledge, your justification is a reliable indicator of the truth — you see a red barn, and that perception justifies "there's a red barn," and the truth and the justification are connected because the barn itself caused your perception. Gettier cases sever this connection. Your justification is legitimate, the belief turns out true, but the truth is reached by a route different from the one your justification tracks. The coin-in-the-pocket case is the original: Smith justifiably believes "Jones will get the job" (on good evidence) and "Jones has ten coins in his pocket" (having personally counted them). Smith infers "the man who will get the job has ten coins in his pocket." The inference is valid; the conclusion is true. But it's true because Smith himself gets the job, and Smith happens to have ten coins in his pocket — facts Smith didn't know. Smith's justification was for a true belief that reached the truth by accident.

The counterexample method you know is precisely what Gettier deployed: find a case that satisfies the definition yet clearly lacks the property being defined. The philosophical power of his cases comes from their simplicity and reproducibility — you can construct Gettier cases yourself by following a simple recipe. Start with a justified belief in a false proposition P. From P, infer a true proposition Q. Your belief in Q is justified (because it follows from a justified belief), it is true (by construction), but you don't know Q because the false proposition P was your route to it. The truth of Q and your justification are accidentally related.

Post-Gettier epistemology spent decades trying to add a fourth condition to JTB that would close the gap. The no false lemmas response says: your belief must not depend on any false intermediate belief. This blocks Gettier's original cases (both depend on the false belief "Jones will get the job"). But Gettier-style cases can be constructed without false lemmas. In a classic fake barns case: you're driving through a region filled with barn facades, indistinguishable from real barns. You look at the one real barn in the area and form the justified true belief "that's a barn." No false intermediate belief — yet most philosophers say you don't know. The environment was rigged against reliable barn-perception. This reveals that the real problem isn't false lemmas; it's epistemic luck: your belief is true, but it could easily have been false given how things were arranged. Eliminating luck from the conditions for knowledge became the central project of post-Gettier epistemology.

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 → Propositional Connectives → Propositional Semantics and Valuations → Truth Functions and Interpretation → Formula Evaluation and Truth Tables → Logical Equivalence of Formulas → Logical Equivalence in Propositional Logic → Conjunctive and Disjunctive Normal Forms → Sequent Calculus → Soundness and Completeness of Propositional Logic → Validity and Soundness → Logical Form and Argument Patterns → Modus Ponens and Modus Tollens → The Counterexample Method → Gettier Problems

Longest path: 84 steps · 440 total prerequisite topics

Prerequisites (2)

Leads To (7)