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

The Safety Condition for Knowledge

College Depth 97 in the knowledge graph ☐ I know this ☆ Set as goal
47topics build on this
533prerequisites beneath it
See this on the map →
Gettier ProblemsIntroduction to Modal Logic+1 more→→Anti-Luck Conditions and Sensitivity
knowledge safety modal-conditions gettier

Core Idea

The safety condition requires that if one knows a proposition, one could not easily have believed that proposition falsely under similar circumstances. This attempts to rule out Gettier cases by imposing a modal constraint: knowledge requires that one's belief-forming method is sufficiently reliable that nearby possible worlds don't contain false instances of the same belief. Safety captures when true justified belief constitutes genuine knowledge rather than lucky guessing.

How It's Best Learned

Apply the safety condition to Gettier cases and near-miss scenarios. For each case, determine whether the subject's belief-formation method was safe—could they easily have been wrong? Compare with sensitivity.

Common Misconceptions

Explainer

From your study of Gettier problems, you know the central challenge: justified true belief is not sufficient for knowledge. Gettier showed that you can have all three — justification, truth, and belief — and still only be *lucky* that your belief is true. The safety condition is one of the most influential attempts to identify what's missing. It draws on the modal vocabulary you encountered in the introduction to modal logic, which talks about what could or could not easily happen in nearby possible worlds.

The safety condition says: S knows P only if, in nearby possible worlds where S forms the belief that P using the same method as in the actual world, S's belief is true. In other words, your belief is safe if you couldn't easily have been wrong. "Nearby" worlds are worlds that differ from the actual world only in small, easily-occurring ways — a slight change in circumstances, a small alteration in what happened a moment before. If your belief-forming method would have produced a false belief in many such nearby worlds, your belief is unsafe, and you don't have knowledge even if you happen to be right in the actual world.

Here is how safety handles the classic Gettier case of the stopped clock. You glance at a clock that reads 3:00. It is in fact 3:00, and you form the true belief that it's 3:00. But the clock stopped exactly 12 hours ago. In nearby possible worlds — say, you glance a few minutes earlier or later — the clock still reads 3:00 even though the actual time is different. Your belief-forming method (reading the stopped clock) would easily have produced a false belief. So your belief is unsafe, and you don't know the time despite having a justified true belief. Safety correctly diagnoses this as a case of knowledge failure.

Safety is often contrasted with sensitivity, a related modal condition associated with Nozick. Sensitivity says: if P were false, you would not believe P. Safety reverses the direction: if you were to believe P via the same method, P would be true. These sound similar but come apart in important cases. You are sensitive to your belief that you're not a brain in a vat (if you were, you'd believe it differently) but not safe (in nearby worlds where you're almost a brain in a vat, you'd falsely believe you aren't). Conversely, you can be safe about lottery propositions (your ticket almost certainly doesn't win) without being sensitive (if your ticket were the winner, you might still believe you lost). Most epistemologists now favor safety over sensitivity because safety tracks our intuitions about knowledge more reliably — it captures the idea that a knower is not just right by accident, but right in a way that is robust across the situations they might easily have found themselves in.

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 Safety Condition for Knowledge

Longest path: 98 steps · 533 total prerequisite topics

Prerequisites (3)

Leads To (1)