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

Possible Worlds Semantics for Knowledge

Graduate Depth 114 in the knowledge graph ☐ I know this ☆ Set as goal
11topics build on this
764prerequisites beneath it
See this on the map →
Epistemic Logic BasicsIntroduction to Modal Logic+4 more→→Closure Principles FormalizedEpistemic Accessibility Relations
possible-worlds semantics knowledge

Core Idea

Knowledge is represented as truth across a restricted set of possible worlds—those compatible with the agent's evidence or cognitive state. An agent knows p if p is true in all worlds accessible to her; she merely believes p if it is true in some but not all accessible worlds. This model makes precise the intuition that knowledge requires ruling out certain error-possibilities.

Explainer

You have already worked with modal logic and possible worlds semantics: you know that a proposition is necessarily true if it is true in all possible worlds, and possibly true if it is true in at least one. The semantics for knowledge takes this framework and adds a crucial relational structure — the accessibility relation. Rather than asking about all possible worlds, we ask about only those worlds that are epistemically accessible to a particular agent: worlds that are, from her perspective, compatible with everything she knows or has evidence for. This restricted set is called the agent's epistemic range.

The knowledge condition then becomes: an agent knows that p if and only if p is true in every world within her epistemic range. She believes p if p is true in at least some accessible worlds. The gap between these conditions captures the gap between belief and knowledge: a believer's accessible worlds include some in which p is true and some in which it is false; a knower's accessible worlds are all p-worlds. To know p is to have ruled out all the accessible worlds in which p is false. This is not just a formal trick — it makes vivid what knowledge requires: you must have evidence or justification that eliminates the relevant error possibilities.

Consider the standard example. You are looking at a barn in good light, and you believe there is a barn there. But suppose (without your knowing) that you are in "Fake Barn County," where the countryside is full of barn facades that look exactly like barns from the road. In the actual world, you are facing a real barn. But in nearby accessible worlds — ones compatible with your visual evidence — you might be facing a facade. Your evidence does not rule out those worlds. So even though your belief is true, it is not knowledge: your epistemic range contains worlds in which p is false. This is the famous Gettier-style problem made geometrically precise in the possible worlds model.

The accessibility relation does more than locate the agent's evidence. Different constraints on the relation generate different epistemic logics. If the relation is reflexive (every world is accessible to itself), then knowledge is veridical: if you know p, p is true (axiom T). If the relation is also transitive (knowing implies knowing that you know — axiom 4), you get the S4 system; add symmetry and you get S5. Each axiom corresponds to an intuitive principle about knowledge, and the possible worlds framework lets you see exactly what structural commitments are required to validate each principle. This is the power of the formal approach: epistemological choices become geometrical choices about the shape of the accessibility relation, visible and testable in a way that purely verbal formulations often obscure.

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 → A Priori and A Posteriori Knowledge → Rationalism vs. Empiricism → The Problem of Induction → Popper's Falsificationism → Falsifiability as the Criterion of Demarcation → The Falsifiability Criterion and Its Problems → Kuhn's Paradigm Theory → Normal Science and Anomalies → Thomas Kuhn and Paradigm Shifts → Scientific Progress and Convergence to Truth → Scientific Realism → Naturalism About Semantic Facts → Propositions and Semantic Content → Truth Conditions and Meaning → Formal Language and Natural Language Semantics → Two-Dimensional Semantics → Modal Semantics and Possible Worlds → Possible Worlds Semantics for Knowledge

Longest path: 115 steps · 764 total prerequisite topics

Prerequisites (6)

Leads To (2)