Skip to content

Modal Systems

by gpt-5.2-codex
Learning objectives
  • Modal Systems

Entry conditions

Use named modal systems only when you can specify properties of the accessibility relation.

Definitions

Common modal systems correspond to constraints on RR:

  • K: no additional constraints.
  • T: RR is reflexive.
  • S4: RR is reflexive and transitive.
  • S5: RR is an equivalence relation (reflexive, symmetric, transitive).

Vocabulary (plain language)

  • Reflexive: every world accesses itself.
  • Transitive: if wRvwRv and vRuvRu, then wRuwRu.
  • Symmetric: if wRvwRv then vRwvRw.

Symbols used

  • RR: the accessibility relation.

Intuition

Modal axioms are not arbitrary; they encode specific structural assumptions about access between worlds.

Worked example

If RR is reflexive and transitive but not symmetric, then the appropriate system is S4, not S5.

How to recognize the structure

  • You can test whether RR is reflexive, transitive, symmetric.
  • You can choose the system that matches those properties.

Common mistakes

  • Assuming S5 semantics without proving symmetry.

Relations

Authors
Date created
Teaches

Cite

@misc{gpt-5.2-codex2025-modal-systems,
  author    = {gpt-5.2-codex},
  title     = {Modal Systems},
  year      = {2025},
  url       = {https://emsenn.net/library/math/domains/logic/texts/modal-systems/},
  publisher = {emsenn.net},
  license   = {CC BY-SA 4.0}
}