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

Gettier Cases and Formal Analysis

College Depth 88 in the knowledge graph ☐ I know this ☆ Set as goal
49topics build on this
472prerequisites beneath it
See this on the map →
Gettier ProblemsThe Justified True Belief Account of Knowledge+2 more→→Anti-Luck Conditions and SensitivityMulti-Case Analysis and Knowledge Conditions+1 more
gettier knowledge counterexamples formal-analysis

Core Idea

Gettier cases present situations where someone has a justified true belief that fails to constitute knowledge due to a subtle break in the truth-dependence of justification. Formal analysis of these cases reveals the need for additional conditions beyond JTB to capture what knowledge really requires. The systematic study of Gettier cases has become central to contemporary epistemology.

How It's Best Learned

Work through classic cases like the Smith-Jones example and the barn facade problem. Try to identify what exactly goes wrong in each case and why the person doesn't have knowledge despite meeting traditional JTB conditions. Then attempt to construct your own Gettier-style cases to test proposed definitions.

Common Misconceptions

Explainer

You already know the justified true belief (JTB) analysis of knowledge — that S knows that P if and only if P is true, S believes P, and S is justified in believing P — and you have encountered Gettier problems as counterexamples showing that JTB is insufficient. Formal analysis of Gettier cases goes further: it asks exactly *why* each case fails and what that reveals about the structure of knowledge.

The original Gettier case has a precise structure. Smith justifiably believes "Jones will get the job and Jones has ten coins in his pocket." He infers the logical consequence: "The person who will get the job has ten coins in their pocket." This inference is valid. But Smith, not Jones, gets the job — and Smith happens to have ten coins in his own pocket. So the proposition is true, Smith believes it, and the belief is justified by valid reasoning from a justified premise. Yet something has clearly gone wrong: Smith's true belief is accidentally true. His justification supports the proposition only through a false intermediate belief (that Jones will get the job). The truth of the final proposition is "disconnected" from what actually made the intermediate premise true.

Formal analysis identifies the failure point: the justification that supports the belief is not properly connected to the truth-maker of the belief. In the Smith-Jones case, the justification runs through a false lemma. This diagnosis led to the No False Lemmas condition: knowledge requires that S's belief not be inferred through any false intermediate premise. But this patch is too narrow. The barn facade case shows a Gettier structure without any false lemma. Henry drives through an area that looks normal but is filled with fake barn facades; one real barn is in the field, and Henry happens to look at it and form the true belief "that's a barn." He uses no false premise, but he still lacks knowledge because in that environment, his belief-forming process is unreliable.

What formal analysis across many cases reveals is a general pattern: epistemic luck is the culprit. In every Gettier case, the agent's justification and the truth of the belief come apart in some way — the belief is true, but not *because of* the justification. This suggests that knowledge requires some kind of robust connection between justification and truth: a condition ensuring that the agent's belief-forming process or justification is sensitive to the actual truth-maker. Different proposals — safety conditions, sensitivity conditions, tracking theories, no-defeat conditions — each try to capture this connection differently. Analyzing Gettier cases formally is the method epistemologists use to test these proposals, seeking cases where the proposed condition is satisfied but knowledge is still intuitively absent, or vice versa.

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

Longest path: 89 steps · 472 total prerequisite topics

Prerequisites (4)

Leads To (3)