Docs / Studies / Studies.Gazdar1979

Pragmatics: Implicature, Presupposition, and Logical Form

Gazdar, G. (1979). Academic Press

This file formalizes Gazdar's projection of implicatures. Asserting a sentence commits the speaker to knowing it, in Hintikka's logic of what the speaker knows and leaves possible, and the sentence potentially implicates that the speaker leaves possible each clause it leaves open and its negation, and knows false the stronger scalar alternative of each part it entails. The context adds these in that order, each only so far as it fits, so that John did it or Mary did it implicates not both and John did it or Mary did it or both of them did it does not, though the two are truth-conditionally equivalent.

Implementation notes

  • Sentences are formulas of EpistemicLogic with the speaker as their one agent. In the examples a world pairs a valuation of two atoms with the valuations the speaker's information leaves open, so that knowledge is S5 there, a special case of the S4 Gazdar takes from Hintikka.
  • Presuppositions are not modelled: their potential set is empty, and condition (iv) of (V), which refers to them, is dropped.
  • A scale gives the stronger alternative of a part, ⟨and, or⟩ and ⟨all, some⟩.

References

Contexts and satisfiable incrementation

L60
L62
L64–67
L69–72

Implicatures

L84–85
L87–96
L104–107
L109–113

(XVII) and p. 136: a scalar implicature that the speaker knows not χ is cancelled when a clausal implicature that the speaker leaves χ possible is added before it.

theorem K_neg_not_mem_updateL150–160
{V : Type u_1} {W : Type u_2} (M : EpistemicLogic.Model V Unit W) {φ : EpistemicLogic.Formula V Unit} {s : EpistemicLogic.Formula V Unit → Option (EpistemicLogic.Formula V Unit)} {χ : EpistemicLogic.Formula V Unit} (hcon : Con (insert (den M (EpistemicLogic.Formula.K () φ)) ∅ ∪ clausal M φ)) (hP : den M (EpistemicLogic.Formula.P () χ) ∈ clausal M φ) (hne : ∀ x ∈ insert (den M (EpistemicLogic.Formula.K () φ)) ∅ ∪ clausal M φ, ∃ w ∈ x, w ∉ den M (EpistemicLogic.Formula.K () χ.neg)) :
den M (EpistemicLogic.Formula.K () χ.neg) ∉ update M s ∅ φ

Built from , , ,

The examples

A world of the examples is a valuation of two atoms with the set of valuations the speaker's information leaves open, among the admissible ones; the speaker's alternatives to a world are the worlds with the same set.

L180
L211–212

(18)-(20): John did it or Mary did it implicates that the speaker knows not (John did it and Mary did it), and the truth-conditionally equivalent John did it or Mary did it or both of them did it does not, its clausal implicature that the speaker leaves (20) possible excluding the scalar one.

theorem exclusiveL214–237

Built from , , ,

L241–254

(21)-(23): some of the students were there implicates that the speaker knows not all of them were, and some, if not all, of the students were there does not, its clausal implicature that the speaker leaves (23) possible excluding the scalar one.

theorem notAllL256–278

Built from , , , ,

The judged readings of (18), (19), (21) and (22): a sentence has the reading not both or not all exactly when its update adds the scalar implicature.

theorem rows_readingL280–292

Built from , , , , ,