Modal System
Let be a modal algebra, i.e., a Boolean algebra equipped with a unary operator satisfying and (normality).
Definition. A modal system (or normal modal logic) is a set of modal formulas containing all propositional tautologies and the axiom
closed under modus ponens, uniform substitution, and the necessity rule (if then ). 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 | reflexive | |
| K4 | transitive | |
| S4 | T + 4 | a preorder |
| B | T + | reflexive + symmetric |
| S5 | S4 + | an equivalence relation |
Proposition (Soundness and completeness). Each system in the table above is sound and complete with respect to the corresponding class of Kripke frames: if and only if 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 to be the set of maximal -consistent sets, define iff , and verify the truth lemma. The frame condition on the canonical follows from the axioms of .
Proposition. The modal algebras for S4 are exactly the closure algebras: Boolean algebras with a closure operator (extensive, monotone, idempotent, preserving ). The fixed-point set is a Heyting algebra.
Proof sketch. Extensiveness corresponds to the T axiom, idempotence to the 4 axiom. The set is closed under and ; it inherits a Heyting implication .
Examples.
- K is the modal logic of arbitrary modal operators on Boolean algebras.
- S4 is the modal logic of topological spaces, where is the interior operator and is the closure operator.
- S5 is the modal logic of possibility where all worlds are mutually accessible; the operator is a two-valued modality ( in any simple algebra).