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: v3 · 2026-09-19 · History
Domain-specific #: 1225
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomains: Mathematical Logic, Modal Logic → Mathematics

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.

How would you explain it like I'm…

The Could-Be Arrows

Imagine lots of different make-believe versions of how things could be. From each version, arrows point to the other versions that count as possible from there. Something 'must' be true if it's true in every version the arrows point to, and 'might' be true if it's true in at least one. The arrows are called the accessibility relation, and they don't mean you can actually travel anywhere.

Which Worlds Count

Logicians who study words like 'must' and 'might' use a picture of many possible worlds or situations. The accessibility relation is a set of arrows that says, from each world, which other worlds count as options. 'It must be raining' is true at a world if it's raining in every world its arrows point to; 'it might be raining' is true if it's raining in at least one. The word 'accessible' doesn't mean you can actually get there - it just means that world is on the list of options. Changing the rules for how arrows can be drawn changes which statements about 'must' and 'might' are always true.

Modal Accessibility Relation

In modal logic, the logic of necessity and possibility, a Kripke frame has a set of worlds (or states) and an accessibility relation R saying which worlds are alternatives from which. If world w has an arrow to v, then v is one of the options considered from w. 'Necessarily P' is true at w if P is true in every world accessible from w; 'possibly P' is true at w if P is true in at least one. The relation does two jobs: locally it picks out which worlds a modal statement talks about, and globally its properties, like whether every world can access itself, decide which modal laws hold. 'Accessible' is a technical word, not a claim about physical reachability or ease, and depending on the application it might mean what's possible, what fits someone's knowledge, or what a rule allows.

An accessibility relation is the binary relation R on a nonempty set of worlds or states W that forms a Kripke frame F = ⟨W, R⟩; adding a valuation V gives a model M = ⟨W, R, V⟩, but R belongs to the frame and can be studied independently of valuation. In normal propositional modal logic, M, w ⊨ □φ holds iff φ holds at every v with wRv, and M, w ⊨ ◇φ holds iff φ holds at some v with wRv. The relation therefore does two jobs. Locally, it fixes which worlds a modal operator quantifies over at a point. Globally, its structural properties constrain which formulas are valid on every model over the frame: reflexivity, seriality, symmetry, transitivity and Euclideanness correspond to familiar axiom schemas under frame validity. This correspondence is the bridge between modal syntax and relational semantics. 'Accessible' is semantic terminology, not physical reachability, ease or permissibility; wRv may encode relative metaphysical possibility, epistemic compatibility, normative ideality, successor states of a process, or another specified range condition.

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.

What is the nonempty set W of worlds or states?
What exactly makes an ordered pair (w,v) a member of R?
Which direction does the arrow point, and is R a one-step relation or a closure?
Which modal operator is interpreted by quantifying over R(w)?
Which properties of R are assumed rather than proved?
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¶

Current abstraction Accessibility Relation Domain-specific

Parents (1) — outgoing typed relations

Accessibility Relation is a kind of Relation Prime

every accessibility relation is a binary relation on one set of worlds; this is the broader abstraction this entry instantiates by strict subsumption.

Hierarchy path (1) — routes to 1 parentless root

Accessibility Relation → is a kind of Relation

Neighborhood in Abstraction Space¶

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

Family — Unclustered & Miscellaneous (2769 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25