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

Epistemic Accessibility Relations

Graduate Depth 115 in the knowledge graph ☐ I know this ☆ Set as goal
5topics build on this
766prerequisites beneath it
See this on the map →
Possible Worlds Semantics for KnowledgeEpistemic Properties and Metrics+1 more→→Knowledge and Belief Operators
accessibility-relations modal-frames properties

Core Idea

An accessibility relation R relates possible worlds to possible worlds, with wRw' meaning that world w' is epistemically possible relative to w. The logical properties of R determine the modal axioms: reflexivity (wRw) gives K ⊢ p → p; transitivity (wRw' ∧ w'Rw'' → wRw'') gives positive introspection. Different epistemic situations (justified belief vs. knowledge) correspond to different relational properties.

Explainer

From your work with possible-worlds semantics, you understand that modal claims like "S knows that P" are analyzed by looking across sets of worlds. Roughly, S knows P in world w if P is true in all worlds that are epistemically relevant to S from w. But what determines which worlds count as "epistemically relevant"? This is exactly what an accessibility relation specifies. An accessibility relation R is a binary relation on a set of possible worlds: wRw' means "from world w, world w' is epistemically possible for the agent." A world is epistemically possible from w if, as far as the agent knows in w, that world might be the actual one. The set of worlds accessible from w is the agent's epistemic range — what they cannot rule out.

The power of this framework comes from the connection between the logical properties of R and the modal axioms that hold. Think of properties of relations you may know from logic or mathematics: reflexivity (every world accesses itself), transitivity (if w accesses w' and w' accesses w'', then w accesses w''), symmetry (if w accesses w', then w' accesses w), and Euclidean structure (if w accesses both w' and w'', then w' and w'' access each other). Each property corresponds to a different modal axiom about knowledge. Reflexivity gives the T axiom: Kp → p (if you know p, then p is true). This is the basic distinguishing mark of knowledge over mere belief — you cannot know something false. Reflexivity says the actual world is always in the agent's epistemic range, so whatever is known must hold in the actual world.

Transitivity corresponds to positive introspection (the 4 axiom): if you know p, then you know that you know p (Kp → KKp). If w accesses w' (w' is epistemically possible from w), and w' accesses w'' (w'' is epistemically possible from w'), then transitivity means w also accesses w'' directly — the agent in the actual world can "see through" to everything accessible from the worlds they consider possible. The Euclidean property gives negative introspection (the 5 axiom): if you don't know p, then you know you don't know it (¬Kp → K¬Kp). Together with T and transitivity, the Euclidean property produces the S5 system, which is the standard logic of knowledge in formal epistemology. S4 (T + transitivity) corresponds to a weaker notion that lacks negative introspection.

The philosophical significance is that different epistemic situations can be modeled by choosing which structural properties R satisfies. A skeptical hypothesis challenges reflexivity: the evil-demon scenario tries to insert a world that the actual world accesses — one where P is false — to undermine knowledge claims. Justified belief might correspond to a non-reflexive accessibility relation (the believed worlds need not include the actual world), which is why you can have justified belief in a falsehood but cannot know a falsehood. Formal epistemology uses this machinery to precisely distinguish and argue about these concepts. When philosophers debate whether knowledge requires positive or negative introspection, they are really arguing about whether the accessibility relation for knowledge is transitive or Euclidean — which is a precise, tractable formal question rather than a vague intuitive dispute.

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 → Epistemic Accessibility Relations

Longest path: 116 steps · 766 total prerequisite topics

Prerequisites (3)

Leads To (1)