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

Anti-Luck Conditions and Sensitivity

College Depth 98 in the knowledge graph ☐ I know this ☆ Set as goal
46topics build on this
536prerequisites beneath it
See this on the map →
The Safety Condition for KnowledgeThe Sensitivity Condition and Tracking Truth+1 more→→Epistemic Luck
anti-luck safety sensitivity knowledge

Core Idea

Anti-luck approaches to knowledge add conditions that exclude cases where someone believes something true mostly by luck. The safety condition requires that if the belief were held, the belief would very likely be true; sensitivity requires that if P were false, the belief would not be held. These modal conditions aim to capture the intuition that knowledge is incompatible with too much epistemic luck.

How It's Best Learned

Test safety and sensitivity with lottery cases and fake barn cases. See why each condition handles some cases well but struggles with others. Consider whether combining conditions improves the account or creates new problems.

Common Misconceptions

Explainer

Your prerequisite work on Gettier cases showed that justified true belief is not sufficient for knowledge — someone can believe something, be justified in believing it, and be right, while still clearly not *knowing* it. The barn façade case is canonical: Henry drives through a region where nearly all visible structures are fake barn fronts, but happens to stop in front of the one real barn. He forms the belief "there is a barn in front of me," and he is justified (barn fronts look like barns) and true (it really is a barn). Yet philosophers widely agree Henry does not *know* there is a barn there. The reason is luck: he just happened to stop in front of the one real one. Anti-luck conditions are attempts to diagnose, precisely and rigorously, what kind of luck is incompatible with knowledge.

The sensitivity condition (Nozick) analyzes this in counterfactual terms: you know P only if, if P were false, you would not believe P. Consider the barn case: if there were no barn in front of Henry, he would still believe there was one (because he would be looking at a façade). Sensitivity fails — hence no knowledge. The condition has strong intuitive support. If my belief would remain unchanged even in a world where what I believe is false, something clearly has gone wrong. However, sensitivity runs into trouble with lottery cases. I believe I will not win the lottery; if I had won, I would believe I had won (I would see the ticket). My belief that I will lose is sensitive — but it seems odd to say I *know* I will lose before the draw.

The safety condition (Sosa, Williamson) reverses the conditional: you know P only if, in nearby possible worlds where you believe P by the same method, P is true. For Henry: in nearby worlds (driving through the same region), he believes "there is a barn" based on visual appearance, but in many of those worlds what he is looking at is a façade. Safety fails — hence no knowledge. Safety handles lottery cases more smoothly: in nearby worlds, I do not believe I won the lottery (I only believe it once I see the ticket), so my belief that I have not won can be safe.

The deeper point these conditions illuminate is that knowledge requires a certain kind of modal connection between your belief and the truth. It is not enough that you happened to believe truly; the truth must be reliably involved in why you believe. Your belief must not be the kind that would survive in error-worlds close to the actual one. Neither condition captures this perfectly — there are counterexamples to strong formulations of each — but they focus the investigation in a way that "justified true belief" never did. They explain *why* Gettier cases fail: in each case, the actual world happens to cooperate with the belief, but the nearby counterfactual structure reveals that the connection between belief and truth is fragile rather than robust. Anti-luck conditions try to make "not fragile" precise.

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 → The Sensitivity Condition and Tracking Truth → Anti-Luck Conditions and Sensitivity

Longest path: 99 steps · 536 total prerequisite topics

Prerequisites (3)

Leads To (1)