A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Formal Semantics of Modality and Possibility

Graduate Depth 104 in the knowledge graph ☐ I know this ☆ Set as goal
83topics build on this
653prerequisites beneath it
See this on the map →
Semantic Types and Compositional MeaningFormal Semantics of Tense and Time+1 more→→Possible Worlds SemanticsPresupposition in Formal Semantics
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

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Boolean Algebra → Introduction to Propositional Logic → Introduction to Predicate Logic (First-Order Logic) → First-Order Logic Syntax → Terms and Atomic Formulas in FOL → Variable Binding and Scope → Open and Closed Formulas in First-Order Logic → Variable Substitution and Capture-Avoidance in First-Order Logic → Quantifier Instantiation Rules in First-Order Proof Systems → Universal Quantification: Meaning and Scope → Free Variables and Bound Variables → Substitution and Instantiation in Predicate Logic → Terms and Atomic Formulas → Formulas and Well-Formed Expressions → Structures and Interpretations → Model Interpretation and Satisfaction → Interpretation, Truth, and Satisfaction of Formulas → Logical Consequence and Entailment → Soundness Theorem and Validity of Proof Systems → Deductive Reasoning and Formal Proof Systems → First-Order Resolution → Propositional Resolution → Semantic Tableaux (Propositional) → Semantic Tableaux (First-Order) → Decidable Fragments of First-Order Logic → Gödel's Completeness Theorem for First-Order Logic → Gödel's Incompleteness Theorems → Introduction to Intuitionistic Logic → Introduction to Modal Logic → Modal Semantics: Necessity and Possibility → Intensionality and Possible Worlds Semantics → Event Semantics → Aktionsart (Lexical Aspect) → Tense and Aspect in Formal Semantics → Viewpoint Aspect (Perfective and Imperfective) → Formal Semantics of Tense and Time → Formal Semantics of Modality and Possibility

Longest path: 105 steps · 653 total prerequisite topics

Prerequisites (3)

Leads To (2)