Formal Semantics of Modality and Possibility

Graduate Depth 69 in the knowledge graph I know this Set as goal
Unlocks 77 downstream topics
semantics modality possible-worlds

Core Idea

Modal logic formalizes modality using possible worlds: a sentence is necessarily true if it holds in all accessible worlds, possibly true if it holds in some. Accessibility relations between worlds encode different modal systems (deontic, epistemic, etc.).

Explainer

From your study of semantic types and composition, you know that meaning is built up systematically from the meanings of parts — that expressions denote objects, properties, or truth values, and that composition rules determine how those denotations combine. Modality extends this framework into a new dimension: instead of asking what is true in the actual world, you ask what is true across a space of possible worlds. This is the core innovation of possible-worlds semantics, and it gives formal linguists a powerful tool for analyzing sentences like "It might rain" or "You must submit the form."

The fundamental definitions are these: a proposition is necessarily true if it is true in *every* world accessible from the current one, and possibly true if it is true in *some* accessible world. Think of the current world as a point, and accessibility as a relation that reaches out to other points — other ways things could be or could have been. The sentence "It is possible that unicorns exist" is true just in case there is at least one accessible world where unicorns exist. "It is necessarily true that 2+2=4" is true because in every mathematically coherent world accessible from ours, that arithmetic fact holds. The accessibility relation is the mechanism that makes this framework flexible: by changing which worlds count as accessible, you can model different kinds of modality.

This is where the system gets its real power. Different modal flavors — epistemic (what's possible given what we know), deontic (what's obligatory or permitted given rules), circumstantial (what's possible given physical circumstances), bouletic (what's possible given desires) — all use the same possible-worlds machinery, but with different accessibility relations. "You must leave" in a deontic reading accesses worlds consistent with the relevant rules or norms; in an epistemic reading, it accesses worlds consistent with the speaker's evidence. The word *must* is the same; the accessibility relation shifts. Formally, if *R* is the accessibility relation and *w* is the evaluation world, then □φ (necessarily φ) is true at *w* iff φ is true at all worlds *v* such that *wRv*, and ◇φ (possibly φ) is true at *w* iff φ is true at some such *v*.

Your prerequisite in modal semantics introduced the intuitions behind necessity and possibility. The formal semantics machinery makes those intuitions precise enough to run compositional analyses — the same kind you already know from semantic types. A modal operator like *must* or *might* is a quantifier over worlds: *must* is a universal quantifier (∀w: accessible(w) → φ(w)), and *might* is an existential quantifier (∃w: accessible(w) ∧ φ(w)). This connects modality directly to quantifier semantics, which means the tools you've already built — type theory, functional application, lambda abstraction — apply directly. The remaining challenge is specifying the accessibility relation correctly for each modal context, which is what different modal systems (K, S4, S5, etc.) are doing when they impose constraints on that relation.

Practice Questions 5 questions

Prerequisite Chain

Counting to 10Counting to 20Understanding ZeroThe Number ZeroCounting to FiveOne-to-One CorrespondenceCombining Small Groups Within 5Addition Within 10Addition Within 20Two-Digit Addition Without RegroupingTwo-Digit Addition with RegroupingAddition Within 100Repeated Addition as MultiplicationMultiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Two-Digit by One-Digit DivisionDivision with RemaindersRemainders and Quotients in DivisionDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueReading and Writing DecimalsComparing and Ordering DecimalsAdding and Subtracting DecimalsMultiplying DecimalsDividing DecimalsDividing FractionsMixed Number ArithmeticOrder of OperationsInteger Order of OperationsVariable ExpressionsThe Distributive PropertyVariables and Expressions ReviewIntroduction to PolynomialsAdding and Subtracting PolynomialsMultiplying PolynomialsFactorialPermutationsCombinationsCounting Principles: Addition and Multiplication RulesIntroduction to Graph TheoryPropositional Logic FoundationsLogical Inference and Proof RulesProof Strategies in Discrete MathematicsSoundness and Completeness of Propositional LogicSoundness and Completeness of First-Order LogicCompactness Theorem for First-Order LogicBasic Model TheoryLöwenheim-Skolem TheoremsGödel's Incompleteness TheoremsIntroduction to Intuitionistic LogicIntroduction to Modal LogicModal Semantics: Necessity and PossibilityIntensionality and Possible Worlds SemanticsEvent SemanticsAktionsart (Lexical Aspect)Viewpoint Aspect (Perfective and Imperfective)Formal Semantics of Tense and TimeFormal Semantics of Modality and Possibility

Longest path: 70 steps · 434 total prerequisite topics

Prerequisites (3)

Leads To (2)