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

Modal Semantics and Possible Worlds

Research Depth 113 in the knowledge graph I know this Set as goal
27topics build on this
751prerequisites beneath it
See this on the map →
Introduction to Modal LogicPossible Worlds Semantics+2 moreCounterfactual Conditionals and SimilarityCounterfactual Truth Conditions and Modal Metaphysics+5 more
modality possible-worlds necessity semantics

Core Idea

Modal sentences involving necessity and possibility are analyzed using possible worlds: a sentence is necessarily true iff true at all possible worlds; possibly true iff true at some accessible world. This extends truth-conditional semantics to modal discourse by adding a dimension of possible alternatives.

How It's Best Learned

Understand accessibility relations and how different modal logics (K, S4, S5) correspond to different properties of accessibility. Work through simple modal sentences and their truth conditions across worlds.

Explainer

Modal language — "necessarily," "possibly," "could have been," "must" — is pervasive but semantically opaque without a framework. What does it even mean to say something is necessary? From your study of possible worlds semantics and modal logic, you know the fundamental setup: a possible world is a complete way reality could be or could have been. The actual world is one possible world — the way things are. Other worlds are the ways things might have been. Modal semantics cashes out necessity and possibility as quantification over these worlds.

The core semantic clauses are elegant. A sentence is necessarily true if and only if it is true at every possible world accessible from the world of evaluation. It is possibly true if and only if it is true at some accessible world. The notion of an accessibility relation is what differentiates modal logics. If every world accesses every other, we get S5 — the logic typically used for metaphysical modality, where what's necessarily true is so in all worlds without restriction. If accessibility is reflexive but not symmetric (every world accesses itself, but not necessarily every other), we get different systems. Your modal logic background lets you see that formal axioms correspond to properties of accessibility: the T axiom ("if necessarily p, then p") corresponds to reflexivity — every world accesses itself, so what's necessary in this world is true here.

The philosophical significance goes beyond formal elegance. Possible worlds semantics gives a uniform account of de dicto and de re modality — the difference between necessity attributed to a proposition versus necessity attributed to an object's property. "Necessarily, the number of planets is greater than seven" (de dicto) is false: in some worlds, there are fewer planets. "Eight necessarily has the property of being greater than seven" (de re) is true: in every world, eight exceeds seven. The analysis uses rigid designators — terms like numerals and proper names that pick out the same object in every world — versus non-rigid descriptions like "the number of planets." Kripke's insight was that names are rigid while descriptions often are not, which explains why "Aristotle was necessarily Aristotle" is true but "Aristotle was necessarily the teacher of Alexander" is not.

The framework extends naturally to counterfactual conditionals: "if it had rained, the match would have been canceled" is true at a world w if and only if the closest worlds to w where it rained are worlds where the match was canceled. "Closest" is measured by a similarity ordering — Lewis's account uses exactly this structure. Possible worlds semantics thus serves triple duty: it formalizes modal logic, provides truth conditions for modal language in natural language, and underpins the semantics of counterfactuals. Understanding the unifying role of this framework — how a single ontological apparatus addresses questions from logic, language, and metaphysics simultaneously — is what makes it central to contemporary analytic philosophy.

What did you take from this?

Topics in reflective domains aren't scored by quiz answers. Read, reflect, and mark when you've thought it through.

Quiz me anyway →

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 LogicA Priori and A Posteriori KnowledgeRationalism vs. EmpiricismThe Problem of InductionPopper's FalsificationismFalsifiability as the Criterion of DemarcationThe Falsifiability Criterion and Its ProblemsKuhn's Paradigm TheoryNormal Science and AnomaliesThomas Kuhn and Paradigm ShiftsScientific Progress and Convergence to TruthScientific RealismNaturalism About Semantic FactsPropositions and Semantic ContentTruth Conditions and MeaningFormal Language and Natural Language SemanticsTwo-Dimensional SemanticsModal Semantics and Possible Worlds

Longest path: 114 steps · 751 total prerequisite topics

Prerequisites (4)

Leads To (7)