Extending propositional and predicate logic with modal operators -- necessity and possibility, and their relatives (obligation, knowledge, belief, time). Covers Kripke possible-worlds semantics, accessibility relations, the main modal systems (K, T, S4, S5), translation from natural language, and applications in epistemic, deontic, and temporal reasoning. Use when ordinary logic is insufficient to capture distinctions like "must" vs "might," "knows" vs "believes," "always" vs "sometimes."
Modal logic extends standard logic with operators for modes of truth -- most centrally necessity (□, "box") and possibility (◇, "diamond"). "It is possible that it will rain" is not the same claim as "it will rain," and ordinary propositional logic cannot distinguish them. Modal logic can. The framework also generalizes: the same machinery handles obligation and permission (deontic logic), knowledge and belief (epistemic logic), past and future (temporal logic), and provability (provability logic). The common semantic foundation is Saul Kripke's possible-worlds model. This skill covers the syntax, semantics, proof theory, and applications of modal logic at the level of an upper-undergraduate or early-graduate logic course.
Agent affinity: frege (foundational framing), quine (resistance and critique), tarski (semantic discipline)
Concept IDs: log-propositional-logic, log-predicate-logic, log-proof-techniques, log-logic-in-law
The basic modal operators are:
They are interdefinable:
These duality relations are the modal counterparts of the quantifier dualities in predicate logic, and in Kripke semantics they will turn out to be exactly that.
Saul Kripke's 1959 paper "A Completeness Theorem in Modal Logic" gave the semantic foundation that made modal logic rigorous. The idea:
A Kripke frame is a pair ⟨W, R⟩:
A Kripke model adds a valuation V that assigns a truth value to each atomic proposition at each world.
Truth at a world w in a model:
So □ quantifies universally and ◇ quantifies existentially over accessible worlds.
The intuition. A "possible world" is a complete alternative way things might be. The actual world is one such alternative. The accessibility relation encodes which alternatives are "live" from a given standpoint. Different modal notions (necessity, obligation, knowledge, time) correspond to different accessibility relations.
Different modal logics result from different constraints on the accessibility relation R. Each extra constraint validates additional axioms.
The minimal normal modal logic. Axioms:
K imposes no constraints on R. It is sound and complete for the class of all Kripke frames.
Add T axiom: □φ → φ. "Whatever is necessary is actually true."
Valid iff R is reflexive: every world accesses itself.
T plus 4 axiom: □φ → □□φ. "What is necessary is necessarily necessary."
Valid iff R is reflexive and transitive: if wRv and vRu, then wRu.
S4 plus 5 axiom: ◇φ → □◇φ. "What is possible is necessarily possible."
Valid iff R is an equivalence relation: reflexive, symmetric, and transitive.
S5 is the strongest commonly studied modal system. In S5, the accessibility structure collapses -- every world accesses every other world in its equivalence class. This matches our intuition about logical (or metaphysical) necessity: something is necessary if it holds in every possible world, period, without the filtering that weaker accessibility relations provide.
Translating English modal sentences requires care.
"It is necessary that it is raining" → □R.
"It is possible that it is raining" → ◇R.
"A bachelor is necessarily unmarried." Two readings:
These are not equivalent. De dicto says the sentence is necessarily true; de re says each bachelor has a necessary property. The de re reading is much stronger and more contentious.
"It must be raining" can be epistemic (I conclude from the wet ground) or deontic (it is obligatory that it rain -- strange in English but possible in other contexts). Modal logics distinguish these with different operators.
In epistemic logic, the modal operator is interpreted as knowledge:
The accessibility relation connects worlds that are epistemically indistinguishable for agent i. If w and v are indistinguishable to agent i from w's standpoint, then agent i cannot rule out v as the actual world, so Kᵢφ requires φ to hold in both.
Systems vary on which introspection axioms to accept. Most uncontroversial is T.
Belief is sometimes formalized with a separate operator Bᵢφ that satisfies K and 4 but not T -- you can believe falsehoods.
In deontic logic, the modal operator represents obligation:
The T axiom (Oφ → φ) is NOT adopted in deontic logic -- what ought to be is not always the case.
Temporal logic replaces necessity and possibility with operators about time:
The accessibility relation is an earlier-later ordering. Different temporal logics model linear vs branching time, discrete vs continuous, etc. Temporal logic is critical in verification of concurrent systems (LTL, CTL, CTL*).
W. V. O. Quine was a famous skeptic of modal logic, especially quantified modal logic (QML). His central worry was about de re modality: quantifying into modal contexts raises questions about whether modal properties attach to objects themselves or only to descriptions. "The number of planets is necessarily greater than 7" -- what is the "number of planets" as a referent, independent of the actual astronomical fact?
This debate drove a great deal of 20th-century philosophical logic and is why the logic department's Quine agent carries a skeptical stance as a matter of role.
Kripke argued that de re modality was coherent and that rigid designators (terms that refer to the same object in every possible world) resolved Quine's puzzles. Kripke's Naming and Necessity (1980) is the landmark text.
Kripke also argued for striking metaphysical claims like "a human being could not have had different parents" (necessity of origin). These claims are modal metaphysics, not modal logic per se, but they motivate much of the field.
Claim: In system K, the formula □φ ∧ □ψ → □(φ ∧ ψ) is valid.
Proof sketch: Suppose □φ and □ψ are true at world w. By the semantics, φ is true at every world v with wRv, and ψ is true at every world v with wRv. Therefore at every such v, both φ and ψ are true, so φ ∧ ψ is true at v. Since this holds for every accessible v, □(φ ∧ ψ) is true at w.
This is a typical modal-semantic argument: chase the semantics across worlds.
propositional-logic or predicate-logic.informal-fallacies or critical-argumentation.mathematical-proof-logic -- "necessarily" in math usually means "in every model," which is first-order.When you encounter an argument involving modality: