Skip to content

Modal System

Defines Modal System, modal systems

Let (A,)(A, \Box) be a modal algebra, i.e., a Boolean algebra AA equipped with a unary operator  ⁣:AA\Box \colon A \to A satisfying =\Box\top = \top and (ab)=ab\Box(a \wedge b) = \Box a \wedge \Box b (normality).

Definition. A modal system (or normal modal logic) Λ\Lambda is a set of modal formulas containing all propositional tautologies and the axiom

K ⁣:  (φψ)(φψ),\mathbf{K}\colon\; \Box(\varphi \to \psi) \to (\Box\varphi \to \Box\psi),

closed under modus ponens, uniform substitution, and the necessity rule (if φ\vdash \varphi then φ\vdash \Box\varphi). A modal system is identified with the class of modal algebras validating its theorems.

Definition. The principal systems extending K are defined by adding axioms:

System Additional axiom(s) Frame condition
T φφ\Box\varphi \to \varphi RR reflexive
K4 φφ\Box\varphi \to \Box\Box\varphi RR transitive
S4 T + 4 RR a preorder
B T + φφ\varphi \to \Box\Diamond\varphi RR reflexive + symmetric
S5 S4 + φφ\Diamond\varphi \to \Box\Diamond\varphi RR an equivalence relation

Proposition (Soundness and completeness). Each system Λ\Lambda in the table above is sound and complete with respect to the corresponding class of Kripke frames: Λφ\Lambda \vdash \varphi if and only if φ\varphi is valid on every frame satisfying the given condition.

Proof sketch. Soundness is verified by checking each axiom against the frame condition. Completeness is proved via the canonical model: take WW to be the set of maximal Λ\Lambda-consistent sets, define wRvwRv iff {a:aw}v\{a : \Box a \in w\} \subseteq v, and verify the truth lemma. The frame condition on the canonical RR follows from the axioms of Λ\Lambda. \square

Proposition. The modal algebras for S4 are exactly the closure algebras: Boolean algebras with a closure operator \Box (extensive, monotone, idempotent, preserving \top). The fixed-point set A={a:a=a}A^{\Box} = \{a : \Box a = a\} is a Heyting algebra.

Proof sketch. Extensiveness corresponds to the T axiom, idempotence to the 4 axiom. The set AA^{\Box} is closed under \wedge and \top; it inherits a Heyting implication ab=(¬ab)a \Rightarrow b = \Box(\neg a \vee b). \square

Examples.

  • K is the modal logic of arbitrary modal operators on Boolean algebras.
  • S4 is the modal logic of topological spaces, where \Box is the interior operator and \Diamond is the closure operator.
  • S5 is the modal logic of possibility where all worlds are mutually accessible; the operator \Box is a two-valued modality (a{,}\Box a \in \{\bot, \top\} in any simple algebra).

Relations

Date created
Mathematical object
Modal algebra
Referenced by

Cite

@misc{emsenn2025-modal-system,
  author    = {emsenn},
  title     = {Modal System},
  year      = {2025},
  url       = {https://emsenn.net/library/math/domains/logic/terms/modal-system/},
  publisher = {emsenn.net},
  license   = {CC BY-SA 4.0}
}