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 moreKnowledge 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 ZeroThe Number ZeroCounting to FiveCounting to 10Counting to 20Counting a Set of Objects Up to 20Cardinality: The Last Number CountedMatching Numerals to QuantitiesSubitizing Small QuantitiesAddition Within 10Number Bonds to 10Addition Within 20Doubles and Near DoublesDoubles Facts Within 10Near Doubles Facts Within 20Mental Math Strategies for AdditionMental Math: Adding and Subtracting TensAddition Within 100Repeated Addition as MultiplicationMultiplication as Equal GroupsMultiplication: ArraysBasic Multiplication Facts (0s, 1s, 2s, 5s, 10s)Multiplication 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 100Multiplication and Division Fact FamiliesRelationship Between Multiplication and DivisionDivision Facts as Inverse of MultiplicationRemainders and Quotients in DivisionDivision Word ProblemsMulti-Step Word ProblemsSolving Multi-Step Word ProblemsMultiplication Word ProblemsDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineComparing and Ordering IntegersAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersIntroduction to ExponentsOrder 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 EquivalencesBoolean AlgebraIntroduction to Propositional LogicIntroduction to Predicate Logic (First-Order Logic)First-Order Logic SyntaxTerms and Atomic Formulas in FOLVariable Binding and ScopeOpen and Closed Formulas in First-Order LogicVariable Substitution and Capture-Avoidance in First-Order LogicQuantifier Instantiation Rules in First-Order Proof SystemsUniversal Quantification: Meaning and ScopeFree Variables and Bound VariablesSubstitution and Instantiation in Predicate LogicTerms and Atomic FormulasFormulas and Well-Formed ExpressionsStructures and InterpretationsModel Interpretation and SatisfactionInterpretation, Truth, and Satisfaction of FormulasLogical Consequence and EntailmentSoundness Theorem and Validity of Proof SystemsDeductive Reasoning and Formal Proof SystemsFirst-Order ResolutionPropositional ResolutionSemantic Tableaux (Propositional)Semantic Tableaux (First-Order)Decidable Fragments of First-Order LogicGödel's Completeness Theorem for First-Order LogicGödel's Incompleteness TheoremsIntroduction to Intuitionistic LogicIntroduction to Modal LogicA Priori and A Posteriori KnowledgeRationalism vs. EmpiricismThe Problem of InductionPopper's FalsificationismFalsifiability as the Criterion of DemarcationThe Falsifiability Criterion and Its ProblemsKuhn's Paradigm TheoryNormal Science and AnomaliesThomas Kuhn and Paradigm ShiftsScientific Progress and Convergence to TruthScientific RealismNaturalism About Semantic FactsPropositions and Semantic ContentTruth Conditions and MeaningFormal Language and Natural Language SemanticsTwo-Dimensional SemanticsModal Semantics and Possible WorldsPossible Worlds Semantics for KnowledgeEpistemic Accessibility Relations

Longest path: 116 steps · 766 total prerequisite topics

Prerequisites (3)

Leads To (1)