Gettier Cases and Formal Analysis

College Depth 61 in the knowledge graph I know this Set as goal
Unlocks 48 downstream topics
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

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 LogicValidity and SoundnessLogical Form and Argument PatternsModus Ponens and Modus TollensThe Counterexample MethodGettier ProblemsGettier Cases and Formal Analysis

Longest path: 62 steps · 333 total prerequisite topics

Prerequisites (4)

Leads To (3)