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

Presupposition in Formal Semantics

Graduate Depth 107 in the knowledge graph ☐ I know this ☆ Set as goal
737prerequisites beneath it
See this on the map →
Semantic Types and Compositional MeaningDerivational Morphology+7 more→
semantics presupposition logic

Core Idea

Formal accounts distinguish presupposition (background assumptions required for a sentence to have a truth value) from assertion (the main claim). Presuppositions project—they are preserved in negation and under quantifiers—a key property formalized in theories like Partial Function Logic.

Explainer

From semantic types and composition, you know that sentences denote functions from possible worlds to truth values — in any world, the sentence is either true or false. But some sentences fail to have a truth value in certain contexts, not because they are false, but because something their meaning assumes to be true is not. "The king of France is bald" is neither true nor false (on the standard analysis) in the actual world, because there is no king of France. The sentence presupposes that a king of France exists; when that presupposition fails, the assertion is left without a truth value. This is different from falsehood — "The king of France is bald" is false only if there is a king of France who is not bald.

The formal signature that distinguishes presupposition from ordinary assertion is projection behavior under operators. Ordinary asserted content disappears under negation: "It is raining" is false when negated to "It is not raining." But presuppositions survive: "The king of France is not bald" still carries the presupposition that France has a king. They also project out of questions ("Is the king of France bald?" — still assumes France has a king) and out of conditional antecedents ("If the king of France is bald..." — same assumption). The diagnostic test for presupposition is this survival: content that is asserted is canceled by negation; content that is presupposed projects through negation, questioning, and embedding. If a piece of content is preserved when you negate the sentence, it was presupposed, not asserted.

The partial functions formalization captures this directly. Rather than assigning every sentence a defined truth value in every world, a sentence with a presupposition denotes a partial function: it is defined (returns T or F) only in worlds where the presupposition holds, and undefined in worlds where it fails. Negation under this account only applies to defined values — undefined stays undefined. This gives the projection behavior automatically: in worlds where France has no king, neither the sentence nor its negation has a truth value. Three-valued logics generalize this by adding a third value (undefined, ⊥, or indeterminate) alongside true and false, with designated truth tables that keep ⊥ stable under most operations.

A complementary treatment uses dynamic semantics, where sentences update a context set (the set of possible worlds consistent with what is mutually assumed by the discourse participants). Presuppositions are then requirements on the input context: a sentence with a presupposition is only well-formed if the context already entails the presupposed content. When a sentence is uttered in a context where the presupposition is not already entailed, listeners typically perform presupposition accommodation — silently adding the presupposed content to the common ground before processing the assertion. "My sister is coming to dinner tonight" presupposes the speaker has a sister; an interlocutor who didn't know this accommodates it rather than objecting. The distinction between what must already be in context (presupposition) and what the sentence contributes to context (assertion) formalizes the intuition that presuppositions convey background information while assertions convey news.

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 → Possible Worlds Semantics → Model-Theoretic Semantics and Truth Conditions → Presupposition in Formal Semantics

Longest path: 108 steps · 737 total prerequisite topics

Prerequisites (9)

Leads To (0)

No topics depend on this one yet.