Modal Logic
Modal logic is the study of deductive reasoning involving expressions that qualify the truth of a statement — most fundamentally necessity (“it is necessary that”) and possibility (“it is possible that”). These are denoted by the box operator □ and the diamond operator ◇, respectively. The two are duals: ◇A is equivalent to ¬□¬A, mirroring the relationship between ∀ and ∃ in predicate logic. Modal logic extends propositional calculus by adding these intensional operators, whose truth value at a given state depends not just on the current state of affairs but on how things could have been — on possible worlds. 1
A Simplifying Introduction
The central insight of modal logic is that some truths hold necessarily (true in all possible scenarios) while others hold only contingently (true in the actual world but not in every possible one). The statement “2+2=4” is necessarily true; “it is raining in Hong Kong” is only contingently true. Modal logic provides a formal calculus for reasoning about this distinction. At its core, it asks: what follows from the fact that something must be the case, or might be the case? This simple framework turns out to be remarkably general — the same formal apparatus captures obligation (deontic logic: “it is obligatory that”), time (temporal logic: “it will always be the case that”), knowledge (epistemic logic: “it is known that”), and belief (doxastic logic). All of these share the same structural rules; they differ only in which additional axioms govern the behaviour of the operator. 1
The Family of Modal Logics
The term “modal logic” covers a family of related systems, all built on a common foundation but differing in which axioms they adopt. The base system is K (named after Saul Kripke), which adds two principles to propositional logic:
- Necessitation Rule: If A is a theorem of K, then so is □A. (Any theorem of logic is necessary.)
- Distribution Axiom (K): □(A→B) → (□A → □B). (If it is necessary that A implies B, then if A is necessary, B is necessary too.)
K is too weak for most philosophical purposes. The key insight is that different conceptions of necessity, obligation, or time demand different additional axioms, each corresponding to a structural property of the accessibility relation between possible worlds (see kripke-semantics). The most important axioms are:
| Axiom | Formula | Frame Condition | R is… |
|---|---|---|---|
| (M)/(T) | □A → A | wRw | Reflexive |
| (D) | □A → ◇A | ∃u wRu | Serial |
| (4) | □A → □□A | (wRv ∧ vRu) → wRu | Transitive |
| (B) | A → □◇A | wRv → vRw | Symmetric |
| (5) | ◇A → □◇A | (wRv ∧ wRu) → vRu | Euclidean |
Key Systems
The most widely studied systems are built by combining these axioms:
- K — the minimal normal modal logic (necessitation + distribution)
- T (or M) — K + (M): whatever is necessary is true. The basic logic of necessity.
- D — K + (D): whatever is necessary is possible. The basic deontic logic.
- S4 — T + (4): iteration of the same operator is idempotent (□□A = □A)
- B — T + (B): the Brouwer system
- S5 — T + (5): the strongest of the standard systems; any string of modal operators collapses to the last one. See s5-modal-logic.
The hierarchy is strict: S5 ⊃ S4 ⊃ T ⊃ K. Each stronger system validates everything the weaker one does, plus additional theorems. 1
Iteration and Reduction
A distinctive feature of modal logics is how they handle iterated operators — strings like □◇□A. In K, such strings cannot be simplified at all. In S4, any string of the same operator reduces to a single instance (□□A = □A, ◇◇A = ◇A). In S5, the reduction is even more powerful: any mixed string of boxes and diamonds collapses to the last operator in the string. So □◇□◇A simplifies to ◇A. This makes S5 particularly mathematically elegant, though its reduction principles can be philosophically controversial — notably, “possibly necessary” becomes simply “necessary” in S5, which underpins modal versions of the ontological argument. 1
Beyond Alethic Modality
The same formal framework extends to other domains by reinterpreting the box operator:
- Deontic logic: □ = “it is obligatory that”; ◇ = “it is permitted that”
- Temporal logic: □ = “it will always be the case that”; ◇ = “it will be the case that”
- Epistemic logic: K_A = “agent A knows that”; governed by different axioms
- Doxastic logic: B_A = “agent A believes that”
The choice of axioms depends on the intended reading. For instance, axiom (M) (□A → A) is appropriate for alethic necessity but clearly wrong for deontic obligation (things that ought to be need not actually be). This is why there is no single “correct” modal logic but rather a family of systems, each suited to a different interpretation. 1
The General Axiom (Scott–Lemmon)
Lemmon and Scott (1977) showed that many modal axioms share a common form:
(G): ◇ʰ□ⁱA → □ʲ◇ᵏA
where ◇ⁿ denotes n diamonds and □ⁿ denotes n boxes. Each such axiom corresponds to a specific condition on the accessibility relation R (the hijk-convergence condition). This elegant correspondence explains why each axiom matches a frame property: (4) is the case h=0, i=1, j=2, k=0; (B) is h=0, i=0, j=1, k=1; (5) is h=1, i=0, j=1, k=1. 1
See Also
- s5-modal-logic — The strongest standard modal system; characterized by equivalence relations on frames
- kripke-semantics — Possible worlds semantics; the formal framework connecting axioms to frame conditions
- alvin-plantinga — Used S5’s reduction principles in modal arguments for theism
- gottfried-wilhelm-leibniz — Originated the possible worlds framework and the modal ontological argument
- possibilism-actualism — Ontological debate about the status of merely possible objects
- ontological-arguments — A priori arguments for God’s existence; the modal version relies on S5
- aristotle — Aristotelian essentialism about natural kinds; foundational to the modal notions of essence and necessity
References
- Garson, J. (2023). “Modal Logic.” Stanford Encyclopedia of Philosophy. 1
- Lewis, C. I. & Langford, C. H. (1932). Symbolic Logic. (Original proposal of the S1–S5 systems)
- Chellas, B. F. (1980). Modal Logic: An Introduction. Cambridge University Press.
- Hughes, G. E. & Cresswell, M. J. (1996). A New Introduction to Modal Logic. Routledge.