The projected presupposition at a given polarity context.
In the simplest case, presupposition projection is polarity-independent: the presupposition of "not P" is the same as the presupposition of "P". This function captures that basic behavior.
More complex interactions (e.g., presupposition strengthening under negation) would require extending this.
Equations
Instances For
Filtering is independent of assertion polarity.
When computing presupposition projection for filtering connectives, the presupposition formula (p.presup && (!p.assertion || q.presup)) doesn't depend on whether we're in a UE or DE context.
The polarity-dependence enters only in which alternatives we consider for exhaustification, not in the projection algorithm itself.
Negation preserves presupposition regardless of polarity.
A presupposition projection context tracks both:
- The polarity (UE/DE) for implicature computation
- The accumulated presupposition projection
The semantic context function (for computing entailments)
- polarity : Core.NaturalLogic.ContextPolarity
Whether the context is UE or DE
- accumulatedPresup : BProp W
The presupposition accumulated from outer operators
Instances For
Compose two presupposition contexts.
When composing contexts (e.g., "not (if P then Q)"), we compose:
- The semantic context functions
- The polarities (using composition rules: DE ∘ DE = UE, etc.)
- The accumulated presuppositions (conjunction)
Equations
- One or more equations did not get rendered due to their size.
Instances For
The identity presupposition context.
Equations
- Semantics.Entailment.PresuppositionPolarity.identityPresupContext = { context := id, polarity := Core.NaturalLogic.ContextPolarity.upward, accumulatedPresup := fun (x : W) => true }
Instances For
Negation context: flips polarity, preserves presupposition.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Presupposition projection behavior varies by quantifier.
Following @cite{heim-1983}:
- Universal: "Every F is G" presupposes every F satisfies G's presup
- Existential: "Some F is G" presupposes some F satisfies G's presup (or: at least one F exists)
This is a placeholder for more sophisticated treatment.
- universal : QuantifierProjection
- existential : QuantifierProjection
- none : QuantifierProjection
Instances For
Equations
- One or more equations did not get rendered due to their size.