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

Modal Semantics: Necessity and Possibility

Research Depth 97 in the knowledge graph ☐ I know this ☆ Set as goal
91topics build on this
558prerequisites beneath it
See this on the map →
Introduction to Modal LogicMontague Semantics→→Formal Semantics of Modality and PossibilityIntensionality and Possible Worlds Semantics+1 more
semantics modality possible-worlds

Core Idea

Modal expressions are analyzed using possible-worlds semantics: 'necessarily P' is true if P holds in all possible worlds; 'possibly P' if P holds in some possible world. This framework elegantly explains how modals interact with negation and quantifiers ('It's not necessary that everyone attends' differs in truth conditions from 'Everyone must not attend'), resolving ambiguities through formal structure.

Explainer

From Montague semantics, you know how to compute the truth conditions of sentences compositionally — building the meaning of a complex expression from the meanings of its parts using typed lambda calculus. From modal logic, you know the algebraic framework: a Kripke model with a set of possible worlds and an accessibility relation, where □P (necessity) means P is true in all accessible worlds and ◇P (possibility) means P is true in at least one. Modal semantics for natural language is the project of bringing these two frameworks together — applying possible-worlds reasoning to the modals that appear in ordinary speech, like *must*, *might*, *can*, *should*, *necessarily*, and *possibly*.

The first important move is recognizing that natural language modals are not uniform. Epistemic modality concerns what is possible or necessary given what is known: "She must be home — her lights are on" doesn't assert metaphysical necessity but the speaker's evidential commitment. Deontic modality concerns obligations and permissions: "You must report any income over $50,000" says nothing about what is physically necessary but what is required by law or rule. Dynamic modality concerns abilities and dispositions: "She can run a four-minute mile" reports a capacity. The same word (*must*, *can*) shifts meaning across these flavors; the possible-worlds framework handles this by varying what the accessibility relation represents — epistemic necessity ranges over worlds compatible with the speaker's knowledge; deontic necessity ranges over worlds compatible with the relevant rules or norms.

Kratzer's restrictor analysis (the dominant modern account) refines this further. Rather than treating a modal like *must* as simply "in all accessible worlds," Kratzer argues that modals operate on two contextual parameters: a modal base (a set of propositions restricting the relevant worlds — e.g., what is known, what the laws require) and an ordering source (a set of propositions ranking those worlds by some standard of normality or ideality). "You must leave" in a deontic context is evaluated against worlds where relevant rules are satisfied, ranked by how closely they approximate ideal compliance. This two-parameter structure explains why deontic and epistemic modals can differ in their projection behavior and why sentences like "It might be that you must leave" are coherent.

The power of the framework becomes clearest in scope interactions with negation and quantifiers. Consider: "It's not necessary that everyone attends" — here negation takes wide scope over necessity, yielding ¬□(∀x. attends(x)), which means it's not the case that all worlds have universal attendance. Contrast "Everyone must not attend" — parsed as ∀x.□(¬attends(x)), which says for each person, in all relevant worlds, they don't attend. These have very different truth conditions: the first is compatible with some worlds where everyone attends; the second prohibits attendance for each individual. Getting scope interactions right is one of the main motivations for doing modal semantics formally rather than informally — intuitions about these sentences are unreliable, but compositional derivation gives determinate answers.

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

Longest path: 98 steps · 558 total prerequisite topics

Prerequisites (2)

Leads To (3)