Elamur Research⌕
☰
home / papers / 2019 / Presupposition Projection and Repair Strategies in Trivalent Semantics

Presupposition Projection and Repair Strategies in Trivalent Semantics

Paper · 2019 · Yoad Winter

Summary

Trivalent logic, with true, false and presupposition failure, is a standard way to model presupposition projection. The two classic Kleene systems each get half the picture right. Weak Kleene connectives never filter: for a conditional whose antecedent says Sue was once a smoker and whose consequent says she quit, they incorrectly project the presupposition carried by the consequent. Strong Kleene connectives do filter, but they produce weak conditional presuppositions with irrelevant disjuncts. This is the "proviso problem".

Winter shows that dropping truth-functionality opens up operators of intermediate strength. In these operators, the presupposition of the right operand is discarded only when the left operand actually entails it. He defines "Weak Kleene plus" (WK+) operators for left-to-right filtering and "Strong Kleene minus" (SK−) operators for conditional presuppositions, and shows that neither suffers from the proviso problem. He then generalizes these repair strategies from connectives to arbitrary binary functions. This exposes a hierarchy: SK repairs the most, WK repairs nothing, and WK+ and SK− lie strictly between them. The work matters because it reconciles filtering with non-trivial projection inside a purely trivalent semantics.

Key points

  • Elementary presuppositional propositions are built with Blamey's transplication. Projection is measured by the maximal bivalent presupposition (MBP) of a sentence.
  • The running examples use "Sue stopped smoking (Marlboros)". They contrast cases where filtering happens (the antecedent or first conjunct entails the presupposition) with cases where it does not (e.g., "Sue exercises a lot").
  • In the generalization, the core notions are left-determination of a function's value and R-repairability vs. anti-R-repairability of a binary expression.
  • The paper argues that the Tarskian entailment preorder suits natural language better than the SK lattice, which treats failure as ½. Its evidence is that "Sue has stopped shouting" entails "Sue is not shouting" even when the first sentence fails.
  • The work was funded by ERC grant No 742,204.

Interesting ideas

  • I1. Filtering is licensed by an actual entailment between operands rather than by truth-table shape, so a presupposition is dropped only when the earlier material really supports it.
  • I2. The paper places a family of systems on a scale from "no repair" (WK) to "maximal repair" (SK) and builds controlled intermediate points instead of choosing an extreme.
  • I3. Failure is treated as an exception that propagates unless specifically repaired, not as an "unknown" midpoint between true and false.
  • I4. Repair is generalized to any binary function: the result can survive a failed argument only if the other argument determines the value, and only when that determination is systematically tied to the failure.
  • I5. Entailment is kept separate from projection: false and failure behave the same for what a sentence entails but differ in what it projects.

For Mova

How these ideas could serve Mova, our small open language model — its files, stages and tests:

  • I1 (frames): When the prag crate projects presuppositions of embedded clauses, it could check whether the preceding conjunct or antecedent entails the trigger's presupposition before cancelling it, and log that entailment as the explanation.
  • I2 (learn): Self-induced repair rules could be graded by how permissive they are, so evaluation can compare a cautious and a liberal variant against negative controls.
  • I3 (world): Unresolved facts in the world of the text (e.g., a definite with no referent) could be stored as explicit failure states, cleared only by a justified repair, rather than treated as half-true.
  • I4 (answer): Arithmetic in maths word problems could return an answer despite a missing quantity only when the known operand fixes the result (e.g., multiplication by zero), with the reasoning recorded.
  • I5 (answer): School-test readers could judge entailment questions on content alone, while handling presupposition-failure questions ("Did Sue stop?" when she never smoked) on a separate path.

Our summary of the paper, in our own words — not its text. The work belongs to its authors; read it at the links above.

 Institutions

 Fields, topics and concepts

Cite

Cite as Yoad Winter. 2019. Presupposition Projection and Repair Strategies in Trivalent Semantics. Proceedings of the 16th Meeting on the Mathematics of Language.

The paper itself, not this page. BibTeX from the library's record of the work. DOI 10.18653/v1/w19-5703

@inproceedings{winter2019presupposition,
  title = {{Presupposition Projection and Repair Strategies in Trivalent Semantics}},
  author = {Yoad Winter},
  booktitle = {Proceedings of the 16th Meeting on the Mathematics of Language},
  year = {2019},
  doi = {10.18653/v1/w19-5703},
  url = {https://doi.org/10.18653/v1/w19-5703}
}

References

23 references, 2 of them with a card of ours. ↗ leads to the work, «find» searches for one we have no id for yet.

  1. David I. Beaver. 1997. Presupposition. In van Benthem and Alice ter Meulen, editors, Handbook of Logic and Language, pages 939–1008. Elsevier, Amsterdam. find
  2. David I. Beaver. 1999. Presupposition accommodation: A plea for common sense. In Lawrence S. Moss, Jonathan Ginzburg, and Maarten de Rijke, editors, Logic, Language and Computation, volume 2. CSLI Publications, Stanford, CA. find
  3. David I. Beaver. 2001. Presupposition and Assertion in Dynamic Semantics. CSLI Publications, Stanford, CA. find
  4. David I. Beaver and Bart Geurts. 2014. Presupposition. In Edward N. Zalta, editor, The Stanford Encyclopedia of Philosophy, winter 2014 edition. find
  5. Benjamin R. George. 2014. Some remarks on certain trivalent accounts of presupposition projection. Journal of Applied Non-Classical Logics, 24(1-2):86–117. ↗
  6. Bart Geurts. 1996. Local satisfaction guaranteed: A presupposition theory and its problems. Linguistics and Philosophy, 19(3):259–294. ↗
  7. Philippe de Groote and Ekaterina Lebedeva. 2010. Presupposition accommodation as exception handling. In Proceedings of the 11th Annual Meeting of the Special Interest Group on Discourse and Dialogue, pages 71–74. Association for Computational Linguistics.
  8. Irene Heim. 1983. On the projection problem for presuppositions. In Proceedings of WCCFL 2, pages 114–125, Stanford, CA. CSLI Publications. find
  9. Lauri Karttunen and Stanley Peters. 1979. Conventional implicature. In Choon-Kyu Oh and David A. Dinneen, editors, Syntax and semantics, volume 11, pages 1–56. Academic Press, New York. find
  10. Edward L. Keenan. 1973. Presupposition in natural logic. The Monist, 57(3):344–370. ↗
  11. Daniel Lassiter. 2012. Presuppositions, provisos, and probability. Semantics and Pragmatics, 5:1–37. ↗
  12. Matthew Mandelkern. 2016. Dissatisfaction theory. In Procedings of SALT 26, pages 391–416. find
  13. Matthew Mandelkern, Jérémy Zehr, Jacopo Romoli, and Florian Schwarz. 2017. Asymmetry in presupposition projection: The case of conjunction. In Procedings of SALT 27, pages 504–524. ↗
  14. David I. Beaver and Emiel Krahmer. 2001. A partial account of presupposition projection. Journal of Logic, Language and Information, 10(2):147. ↗
  15. Reinhard Muskens. 1995. Meaning and partiality. CSLI Publications, Stanford, CA. find
  16. Johan van Benthem. 1991. Language in Action: Categories, Lambdas and Dynamic Logic. North-Holland, Amsterdam. find
  17. Stanley Peters. 1979. A truth-conditional formulation of Karttunen’s account of presupposition. Synthese, 40(2):301–316. ↗
  18. Stephen Blamey. 1986. Partial logic. In D. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic, volume 3, pages 1–70. D. Reidel Publishing Company, Dordrecht. find
  19. Gennaro Chierchia and Sally McConnel-Ginet. 1990. Meaning and Grammar: an introduction to semantics. MIT Press, Cambridge, Mass. find
  20. Melvin Fitting. 1991. Kleene’s logic, generalized. Journal of Logic and Computation, 1(6):797–810. ↗
  21. Gerald Gazdar. 1979. Pragmatics: Implicature, Presupposition, and Logical Form. Academic Press, New York. find
  22. Benjamin R. George. 2008. Presupposition repairs: a static, trivalent approach to predicting projection. Master thesis, UCLA. find
  23. Philippe Schlenker. 2011. The proviso problem: a note. Natural Language Semantics, 19(4):395–422. ↗

Updated

↑ back to top

This page in Markdown → https://md.research.elamur.ai/free/en/papers/winter-2019-presupposition-projection-repair-strategies-trivalent/