Docs / Studies / Studies.George2014

Some Remarks on Certain Trivalent Accounts of Presupposition Projection

George, B. R. (2014). Journal of Applied Non-Classical Logics, 24(1--2), 86–117

George relates trivalent accounts of presupposition projection to Heim's dynamic one, and derives Peters' Middle Kleene connectives, answering Schlenker's explanatory challenge, by deploying classical truth functions one argument at a time. Deployed on a quantifier, every student has stopped smoking entails that every student has smoked without presupposing it. A quantity-invariant quantifier has a universal entailment when it is true of no two consecutive numbers, and a conservative determiner when its tree holds at no two neighbouring points. Few quantifiers pass: a monotone one with a universal entailment is ∀ or trivially false, and one with a universal presupposition is an even number of things or an odd number of things.

Implementation notes

The update map from trivalent propositions to Heim's updates is in Linglib.Semantics.Dynamic.Partial, deployment and the connectives it derives in Linglib.Logic.Trivalent.Deployment, and the single-step characterization of universal inferences in Linglib.Logic.Trivalent.UniversalInference. George states his results for quantity-invariant quantifiers and conservative ones on a finite non-empty universe. The monotone remarks here need neither quantity invariance nor finiteness, and the parity remarks need finiteness but not quantity invariance. The reading of universal entailments and presuppositions on the Hasse diagram of Set α is not George's, who argues by counting.

TODO

  • Integrate George's isomorphism between Heim's updates and trivalent propositions, already formalized as CCP.Partial.ofTrivalentEquiv in Linglib.Semantics.Dynamic.Partial.
  • George's comparison with the experiments of Chemla, importing Chemla2009a: deployment derives entailments for exactly three (note 26), where Chemla finds rates like those of the existentials.

References

  • George 2014, Some Remarks on Certain Trivalent Accounts of Presupposition Projection
  • Chemla 2009a, Presuppositions of Quantified Sentences: Experimental Data formalized

Universal inferences of a quantifier: Definitions 20–22

L67–70
L72–75

Counting: Propositions 4 and 6

Monotone quantifiers: Remarks 13, 15, 17 and 19

L130–138
L141–151

Parity: Remark 21

The Hasse diagram of Set α

Universal inferences of a determiner: Definitions 20–22

L232–235
L238–241

Counting: Propositions 5 and 7

A conservative, quantity-invariant determiner on a finite universe has a universal entailment exactly when its tree holds at no two points (m + 1, n) and (m, n + 1) (Proposition 5).

theorem Det.universalEntailment_iff_ofDetL279–301
{α : Type u_1} {d : Quantifier.Det α} [Finite α] (hC : d.Conservative) (hQ : d.QuantityInvariant) :
UniversalEntailment d ↔ ∀ (m n : ℕ), ¬(Quantifier.NumberTree.ofDet d (m + 1) n ∧ Quantifier.NumberTree.ofDet d m (n + 1))

Built from

Monotone determiners: Remarks 14, 16, 18 and 20

Parity: Remark 22

L387–392

Every