Skip to content

Accessibility Relation

A binary relation on the worlds or states of a Kripke frame that fixes which alternatives a modal operator quantifies over from each evaluation point.

Version
v2 · 2026-08-30 · History
Domain-specific #
1225
Origin domain
mathematical logic
Subdomain
modal logic

Core Idea

An accessibility relation is the binary relation that gives Kripke-style modal semantics its local range of alternatives. A frame is a pair F = ⟨W,R⟩, where W is a nonempty set of worlds or states and R ⊆ W×W. Writing wRv says that v is an alternative admitted from evaluation point w for the modality being modeled. A model adds a valuation, M = ⟨W,R,V⟩, but the relation belongs to the frame and can be studied independently of how propositional letters are valued.

Scope of Application

The home domain is normal modal logic and its relational semantics. Kripke's early completeness and semantical-analysis work made relations among worlds a basis for distinguishing systems of modal propositional logic. Blackburn, de Rijke, and Venema develop modal languages as tools for analyzing relational structures, separating models, frames, correspondence, definability, completeness, and computational questions.

The same formal role recurs in several modal families. In epistemic logic, a relation R_a can collect the worlds agent a cannot rule out; K_a φ is true when φ holds at all such worlds. A multi-agent model usually carries one indexed relation per agent.

Clarity

A practical diagnostic asks six questions.

  1. What is the nonempty set W of worlds or states?
  2. What exactly makes an ordered pair (w,v) a member of R?
  3. Which direction does the arrow point, and is R a one-step relation or a closure?
  4. Which modal operator is interpreted by quantifying over R(w)?
  5. Which properties of R are assumed rather than proved?
  6. Is the claim about one model and valuation, or validity over every valuation on a frame?

Manages Complexity

An intensional notion such as “possible relative to here,” “compatible with what this agent knows,” or “reachable after one system step” could require a new semantic rule for every context. Accessibility Relation compresses these cases into one binary parameter. The modal language then uses the same two quantifier clauses while the application changes W, R, and the interpretation of the arrows.

Abstract Reasoning

The relation licenses exact inferences.

  • Monotonic range effect: with valuation fixed at the compared worlds, adding R-successors can make a box formula harder to satisfy and a diamond formula easier to satisfy; deleting successors has the opposite tendency. Nested formulas require recomputation because their truth may itself depend on the relation.
  • Vacuity test: a dead-end world satisfies every □φ and no ◇φ under standard normal semantics.
  • Reflexivity: if every world accesses itself, frame validity of □p → p follows; conversely, validity of that schema on a frame forces reflexivity.
  • Transitivity: if wRv and vRu imply wRu, a necessity at w propagates into necessity at accessible v, validating □p → □□p on the frame.
  • Symmetry: if wRv implies vRw, actuality at w is possible from each accessible v, validating p → □◇p.
  • Seriality: if every world has a successor, necessity cannot coexist with impossibility of the same proposition, yielding □p → ◇p.
  • Euclideanness: if two worlds accessible from one origin are related in the required direction, a possibility at the origin remains possible at every accessible world, yielding ◇p → □◇p.
  • Indexed separation: two agents or modalities can share W and V but have different relations, so the same formula can be known by one agent and not another, or executable under one transition type and not another.
  • Bisimulation sensitivity: modal formulas observe relational structure through successor patterns rather than arbitrary set-theoretic detail; suitable bisimulations can preserve modal truth across different-looking models.

Knowledge Transfer

The abstraction transfers literally within relational modal semantics. Alethic, epistemic, doxastic, deontic, temporal, dynamic, and computational interpretations can reuse the same frame structure while changing what an arrow means and which relation properties are justified. A practitioner who understands dead ends, frame validity, indexed relations, and correspondence in one modal family can carry those diagnostics into another.

Relationships to Other Abstractions

Local relationship map for Accessibility RelationParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.AccessibilityRelationDOMAINPrime abstraction: Relation — is a kind ofRelationPRIME

Current abstraction Accessibility Relation Domain-specific

Parents (1) — more general patterns this builds on

  • Accessibility Relation is a kind of Relation Prime

    every accessibility relation is a binary relation on one set of worlds; this is the minimal prospective parent by strict subsumption.

Hierarchy path (1) — routes to 1 parentless root

Neighborhood in Abstraction Space

Accessibility Relation sits in a sparse region of the domain-specific corpus (76th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (1565 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-09-08