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 morePossible 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 ZeroThe Number ZeroCounting to FiveCounting to 10Counting to 20Counting a Set of Objects Up to 20Cardinality: The Last Number CountedMatching Numerals to QuantitiesSubitizing Small QuantitiesAddition Within 10Number Bonds to 10Addition Within 20Doubles and Near DoublesDoubles Facts Within 10Near Doubles Facts Within 20Mental Math Strategies for AdditionMental Math: Adding and Subtracting TensAddition Within 100Repeated Addition as MultiplicationMultiplication as Equal GroupsMultiplication: ArraysBasic Multiplication Facts (0s, 1s, 2s, 5s, 10s)Multiplication 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 100Multiplication and Division Fact FamiliesRelationship Between Multiplication and DivisionDivision Facts as Inverse of MultiplicationRemainders and Quotients in DivisionDivision Word ProblemsMulti-Step Word ProblemsSolving Multi-Step Word ProblemsMultiplication Word ProblemsDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineComparing and Ordering IntegersAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersIntroduction to ExponentsOrder 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 EquivalencesBoolean AlgebraIntroduction to Propositional LogicIntroduction to Predicate Logic (First-Order Logic)First-Order Logic SyntaxTerms and Atomic Formulas in FOLVariable Binding and ScopeOpen and Closed Formulas in First-Order LogicVariable Substitution and Capture-Avoidance in First-Order LogicQuantifier Instantiation Rules in First-Order Proof SystemsUniversal Quantification: Meaning and ScopeFree Variables and Bound VariablesSubstitution and Instantiation in Predicate LogicTerms and Atomic FormulasFormulas and Well-Formed ExpressionsStructures and InterpretationsModel Interpretation and SatisfactionInterpretation, Truth, and Satisfaction of FormulasLogical Consequence and EntailmentSoundness Theorem and Validity of Proof SystemsDeductive Reasoning and Formal Proof SystemsFirst-Order ResolutionPropositional ResolutionSemantic Tableaux (Propositional)Semantic Tableaux (First-Order)Decidable Fragments of First-Order LogicGödel's Completeness Theorem for First-Order LogicGödel's Incompleteness TheoremsIntroduction to Intuitionistic LogicIntroduction to Modal LogicModal Semantics: Necessity and PossibilityIntensionality and Possible Worlds SemanticsEvent SemanticsAktionsart (Lexical Aspect)Tense and Aspect in Formal SemanticsViewpoint Aspect (Perfective and Imperfective)Formal Semantics of Tense and TimeFormal Semantics of Modality and Possibility

Longest path: 105 steps · 653 total prerequisite topics

Prerequisites (3)

Leads To (2)