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 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 PossibilityPossible Worlds SemanticsModel-Theoretic Semantics and Truth ConditionsPresupposition in Formal Semantics

Longest path: 108 steps · 737 total prerequisite topics

Prerequisites (9)

Leads To (0)

No topics depend on this one yet.