---
title: "Solving Some Persistent Presupposition Problems — Mercer 1988"
description: "The paper tackles a set of counterexamples that Soames (1979, 1982) raised against Gazdar's 1979… 16 references, cited by 2 papers here."
authors: ["Robert E. Mercer"]
year: 1988
venue: "Coling Budapest 1988 Volume 2: International Conference on Computational Linguistics"
source: "https://aclanthology.org/C88-2086/"
licence: "CC BY-NC-SA 3.0 (ACL Anthology, before 2016)"
licence_url: "https://creativecommons.org/licenses/by-nc-sa/3.0/"
summary_licence: "Elamur Cosmic License"
canonical: "https://research.elamur.ai/free/en/papers/mercer-1988-solving-some-persistent-presupposition-problems/"
---
[Elamur Research](https://md.research.elamur.ai/free/en/) · [this page in HTML](https://research.elamur.ai/free/en/papers/mercer-1988-solving-some-persistent-presupposition-problems/)

[home](https://md.research.elamur.ai/free/en/) / [papers](https://md.research.elamur.ai/free/en/papers/) / [1988](https://md.research.elamur.ai/free/en/papers/1988/) / Solving Some Persistent Presupposition Problems

# Solving Some Persistent Presupposition Problems

**Authors:** [Robert E. Mercer](https://md.research.elamur.ai/free/en/authors/robert-e-mercer/) · **Year:** 1988 · **Venue:** [Coling Budapest 1988 Volume 2: International Conference on Computational Linguistics](https://md.research.elamur.ai/free/en/venues/coling/) ([COLING 1988](https://md.research.elamur.ai/free/en/venues/coling/1988/)) · **Licence:** [CC BY-NC-SA 3.0 (ACL Anthology, before 2016)](https://creativecommons.org/licenses/by-nc-sa/3.0/)

**Links:** [Publisher's page](https://aclanthology.org/C88-2086/) · [PDF](https://aclanthology.org/C88-2086.pdf) · [OpenAlex](https://openalex.org/W1998356663)

**Citations:** 5 citations (OpenAlex, 2026-10-14) · [2](https://md.research.elamur.ai/free/en/papers/mercer-1988-solving-some-persistent-presupposition-problems/cited-by/) in our library, of the 149,439 papers whose bibliographies we read

## Summary
The paper tackles a set of counterexamples that Soames (1979, 1982) raised against Gazdar's 1979 account of how presuppositions project from complex sentences. The troublesome cases are conditionals ('if … then') where a sentential adverb such as *too* or *again* sits in the antecedent or the consequent. Earlier fixes were Landman's extra clausal implicatures and Soames' own hybrid of the Gazdar and Karttunen–Peters approaches. Both had been argued against, so these examples were left unexplained. Mercer reuses his default-logic theory of presupposition (Mercer 1987, 1988). In that theory, presuppositions are default inferences drawn from a first-order S4 modal representation of the utterance, with operators Ks and Ps. Clausal implicatures decide how the theory is split into cases. The new step is a claim about the conditional: the logically or conversationally prior clause fixes how negation scopes over an adverb in the other clause. With that representation, the presupposition is correctly blocked in most of Soames' examples and correctly kept in one. The paper argues that presupposition depends on semantic representation and negation scope, not only on surface triggers.

## Key points
- Presuppositions are encoded as normal default rules. The paper reinterprets them as follows: if the speaker says α and β is consistent with the hearer's knowledge base KBH, the hearer may conjecture β. An utterance u adds Ks u to KBH.
- Following Gazdar's version of Grice, the speaker becomes committed to PsA, Ps¬A, PsB and Ps¬B whenever they utter a disjunction ('A or B') or a conditional ('if A then B'). These implicatures license a case analysis. For 'A or B' the two cases are A∧¬B and ¬A∧B.
- Default logic has no law of the excluded middle, so case analysis is needed. The cases must be chosen carefully:
  - too few cases let unwanted statements through;
  - too many cases can block valid ones, because the logic is non-monotonic.
- For 'if a then b', the material a⊃b is derived from Stalnaker's conditional a>b. The resulting cases are a∧b and ¬a∧¬b. Default rules for *too* (kick-subject-too) and *again* (call-subject-again) generate the presuppositions.
- In the analyses (33), (34) and (36), negation does not take the adverb in its scope, so the presupposition is not derived. In (35), the adverb is in the prior antecedent, normal wide scope applies, and the presupposition appears.

## Interesting ideas
- The negation test (an inference survives both a sentence and its plain negation) works as an operational filter that separates presuppositions from ordinary entailments.
- Disjunctions and conditionals are split into cases that fully fix every clause's truth value, and an inference is accepted only if it holds in every case.
- A trigger fires only if its default stays consistent with what the hearer already knows, so context can cancel it without any special rule.
- The scope of negation over an adverb like *too* or *again* in one clause is inherited from the logically or conversationally prior clause.
- Separating the speaker's knowledge (Ks) from mere possibility (Ps) lets clausal implicatures be stated precisely.

## For Mova

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

- **I1** (frames): prag could tag a candidate inference as presupposed only if it also holds under the negated frame, which keeps the decision explainable.
- **I2** (world): when a text says "X or Y" or "if X then Y", the world builder could keep parallel case-worlds and promote to the main world only facts that are true in all of them.
- **I3** (world): presupposed facts could be stored as defeasible entries that are withdrawn automatically when they contradict existing world state.
- **I4** (frames): when negating a consequent clause containing a focus adverb, prag could copy the scope decision made for the antecedent instead of always using wide scope.
- **I5** (answer): QA readers could use this to distinguish "the narrator asserts X" from "X is left open" when answering questions about conditional statements in fables.

*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

- [Western University](https://md.research.elamur.ai/free/en/universities/western-university/) — University, London, Canada · 7 works · 278 citations

📚 Shelves (5): [🖥️ Computer Science](https://md.research.elamur.ai/free/en/shelves/computer-science/) · 16,667 works · [🤖 Artificial Intelligence](https://md.research.elamur.ai/free/en/shelves/computer-science/artificial-intelligence/) · 16,194 works · [🎭 Arts and Humanities](https://md.research.elamur.ai/free/en/shelves/arts-and-humanities/) · 16,039 works · [🗣️ Language and Linguistics](https://md.research.elamur.ai/free/en/shelves/arts-and-humanities/language-and-linguistics/) · 15,891 works · [🤔 Philosophy](https://md.research.elamur.ai/free/en/shelves/arts-and-humanities/philosophy/) · 284 works

🧭 Topics (1): [😉 Implicature](https://md.research.elamur.ai/free/en/topics/implicature/) · 138 works

## Cite

Cite as: Robert E. Mercer. 1988. Solving Some Persistent Presupposition Problems. Coling Budapest 1988 Volume 2: International Conference on Computational Linguistics.

The paper itself, not this page. BibTeX from the library's record of the work.

```bibtex
@inproceedings{mercer1988solving,
  title = {{Solving Some Persistent Presupposition Problems}},
  author = {Robert E. Mercer},
  booktitle = {Coling Budapest 1988 Volume 2: International Conference on Computational Linguistics},
  year = {1988},
  doi = {10.3115/991719.991722},
  url = {https://doi.org/10.3115/991719.991722}
}
```

- [← previous A Formal Computational Semantics and Pragmatics of Speech Acts](https://md.research.elamur.ai/free/en/papers/werner-1988-formal-computational-semantics-pragmatics-speech/)
- [next → Finite-state Description of Semitic Morphology: A Case Study of Ancient Accadian](https://md.research.elamur.ai/free/en/papers/kataja-1988-finite-state-description-semitic-morphology/)
- [↑ back to papers of 1988](https://md.research.elamur.ai/free/en/papers/1988/)

## References

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

1. Ga~dar, G. J. M. (1979), Pragmatics: Implicating, Presupposition, and Lo!fical Form, Academic Press. [find](https://scholar.google.com/scholar?q=Ga%7Edar%2C+G%2E+J%2E+M%2E+%281979%29%2C+Pragmatics%3A+Implicating%2C+Presupposition%2C+and+Lo%21fical+Form%2C+Academic+Press%2E)
2. Karttunen, L. (1973), "Presuppositions of Compound Sentences", Linguistic Inquiry 4:169--193. [find](https://scholar.google.com/scholar?q=Karttunen%2C+L%2E+%281973%29%2C+%22Presuppositions+of+Compound+Sentences%22%2C+Linguistic+Inquiry+4%3A169%2D%2D193%2E)
3. Karttunen, L. (1974), "Presupposition and Linguistic Context", Theoretical Linguistics 1:181-194. [↗](https://doi.org/10.1515/thli.1974.1.1-3.181)
4. Karttunen, L. and S. Peters (1975), "Conventional hnplJcature in Montague Grammar", Proceedings of the First Annual Meeting of the llerkeley Linguistics Society, pp 266-278. [find](https://scholar.google.com/scholar?q=Karttunen%2C+L%2E+and+S%2E+Peters+%281975%29%2C+%22Conventional+hnplJcature+in+Montague+Grammar%22%2C+Proceedings+of+the+First+Annual+Meeting+of+the+llerkeley+Linguistics+Society%2C+pp+266%2D278%2E)
5. Karttunen, L. and S. Peters (1979), "Conventional Implicature" in Syntax and Semantics, v.ll, Presuppositions, C.-K. Oh and D. A. Din~en (eds), Academic Press, pp 1-56. [find](https://scholar.google.com/scholar?q=Karttunen%2C+L%2E+and+S%2E+Peters+%281979%29%2C+%22Conventional+Implicature%22+in+Syntax+and+Semantics%2C+v%2Ell%2C+Presuppositions%2C+C%2E%2DK%2E+Oh+and+D%2E+A%2E+Din%7Een+%28eds%29%2C+Academic+Press%2C+pp+1%2D56%2E)
6. Kempson, tl.. M. (1975), Presupposition and the Delimitation of Se-manticv, Cambridge University Press. [find](https://scholar.google.com/scholar?q=Kempson%2C+tl%2E%2E+M%2E+%281975%29%2C+Presupposition+and+the+Delimitation+of+Se%2Dmanticv%2C+Cambridge+University+Press%2E)
7. Landma~l, F. (1981), "A Note on the Projection Problem", Linguistic Inquiry 12:467-471. [find](https://scholar.google.com/scholar?q=Landma%7El%2C+F%2E+%281981%29%2C+%22A+Note+on+the+Projection+Problem%22%2C+Linguistic+Inquiry+12%3A467%2D471%2E)
8. Mercer, It. l'k (1987), A Default Logic Approach to the Derivation of Natural Language Presuppositions, Ph.D. Thesis, Dept. of Computer Science, University of British Columbia. [find](https://scholar.google.com/scholar?q=Mercer%2C+It%2E+l%27k+%281987%29%2C+A+Default+Logic+Approach+to+the+Derivation+of+Natural+Language+Presuppositions%2C+Ph%2ED%2E+Thesis%2C+Dept%2E+of+Computer+Science%2C+University+of+British+Columbia%2E)
9. Mercer, R. E. (1988), "Using Default Logic to Derive Natural Language Presuppositions", Proceedings of the Seventh Biennial Conference of the CSCSI/SCEIO, (to appear). [find](https://scholar.google.com/scholar?q=Mercer%2C+R%2E+E%2E+%281988%29%2C+%22Using+Default+Logic+to+Derive+Natural+Language+Presuppositions%22%2C+Proceedings+of+the+Seventh+Biennial+Conference+of+the+CSCSI%2FSCEIO%2C+%28to+appear%29%2E)
10. Mercer, It. I'L and R. Reiter (1982), "The Representation of Presup-positior~s Using Defaults", Proceedings of the Fourth Biennial Conference of the CSCSI/SCEIO, pp 103-107. [find](https://scholar.google.com/scholar?q=Mercer%2C+It%2E+I%27L+and+R%2E+Reiter+%281982%29%2C+%22The+Representation+of+Presup%2Dpositior%7Es+Using+Defaults%22%2C+Proceedings+of+the+Fourth+Biennial+Conference+of+the+CSCSI%2FSCEIO%2C+pp+103%2D107%2E)
11. ILeiter, P~. (1980), "A Logic for Default l~easoning"~ Artificial Intelligence 13:81-132. [find](https://scholar.google.com/scholar?q=ILeiter%2C+P%7E%2E+%281980%29%2C+%22A+Logic+for+Default+l%7Eeasoning%22%7E+Artificial+Intelligence+13%3A81%2D132%2E)
12. Soames~ S. (1979), "A Projection Problem for Speaker Presuppositions", ~inguistic Inquiry 10:623-666. [find](https://scholar.google.com/scholar?q=Soames%7E+S%2E+%281979%29%2C+%22A+Projection+Problem+for+Speaker+Presuppositions%22%2C+%7Einguistic+Inquiry+10%3A623%2D666%2E)
13. Soames, S. (1982), "How Presuppositions are Inherited: A Solution to the Projection Problem", Linguistic Inquiry 13:483-545. [find](https://scholar.google.com/scholar?q=Soames%2C+S%2E+%281982%29%2C+%22How+Presuppositions+are+Inherited%3A+A+Solution+to+the+Projection+Problem%22%2C+Linguistic+Inquiry+13%3A483%2D545%2E)
14. Stalnaker, 1]. (1968), "A Theory of Conditionals'~ in Studies in Logical Th~!ory, N. Rescher (ed), Basil Blackwell, pp 98-112. [find](https://scholar.google.com/scholar?q=Stalnaker%2C+1%5D%2E+%281968%29%2C+%22A+Theory+of+Conditionals%27%7E+in+Studies+in+Logical+Th%7E%21ory%2C+N%2E+Rescher+%28ed%29%2C+Basil+Blackwell%2C+pp+98%2D112%2E)
15. Stalnaker, 1L (1973), "Presuppositions", Journal of Philosophical Logic 2:447-457. [find](https://scholar.google.com/scholar?q=Stalnaker%2C+1L+%281973%29%2C+%22Presuppositions%22%2C+Journal+of+Philosophical+Logic+2%3A447%2D457%2E)
16. Wilson, l). (1975), Presuppositions and Non-Truth-Conditional Semantics, Academic Press. [find](https://scholar.google.com/scholar?q=Wilson%2C+l%29%2E+%281975%29%2C+Presuppositions+and+Non%2DTruth%2DConditional+Semantics%2C+Academic+Press%2E)

*Updated 1 November 2026*