Docs / Studies / Studies.BuccolaCrnic2021

NPIs, Intervention, and Collectivity

Buccola, B. & Crnič, L. (2021). Semantics and Pragmatics, 14, 2:1–24

This file models the Revised NPI Licensing Condition (LicensingCondition): a negative polarity item is acceptable only in a sentence that is downward entailing with respect to it and that none of its scalar alternatives entails, so that the sentence is a strongest of its alternatives. The condition is stated over a constituent with its alternatives (WithAlternatives), not over the operators above the item, and some constituent containing the item must meet it. In the models the clause below negation is upward entailing with respect to the item, so the condition falls on the negated sentence. Under negation it asks that the positive sentence be a weakest of its alternatives (licensingCondition_compl_iff), the sentence-level counterpart of a scalar term at the bottom of its scale.

With and between any NP and another plurality, the or-alternative entails the sentence whenever the predicate holds of the parts of any plurality it holds of, so conjoined any requires a predicate that is not divisive, while a collective predicate meets the condition. A numeral above one intervenes with a divisive predicate for the same reason, and a universal quantifier over a nonempty domain intervenes with any predicate of individuals, since it entails its existential alternative.

Under doubt, the sentence is a strongest of its alternatives exactly when Chierchia's Strong Application gives it no implicature. Strong Application negates only the alternatives that asymmetrically entail a sentence, so a collective conjunction stays downward entailing with respect to any, while exhaustification against every alternative the sentence does not entail destroys that downward entailment. The condition the substrate places on the environment of a weak item, downward and not upward entailment, is the first clause of the revised condition without the second, and holds of an environment that the revised condition rejects.

Implementation notes

  • Pluralities form a join semilattice with a bottom, conjunction is the join, and the indefinite ranges over the nonzero parts of its restrictor; the models take the finite sets of individuals. A predicate of pluralities is divisive at a world when it holds of the parts of what it holds of (Mereology.DIV), which is antitonicity (antitone_iff_forall_div).
  • Downward entailment with respect to the item is checked under strengthening of its restrictor. The scalar alternatives come with the sentence, so restricting them to local ones is the caller's choice, and an alternative equivalent to the sentence does not entail it in the sense of the condition.
  • The constituents containing the item are the domains of a path (PolarityItem.Path), whose layers apply to the alternatives of the clause. Each model's clause is upward entailing in the restrictor and empty at its bottom, so no clause without the negation meets the condition.
  • The condition is necessary for acceptability; the paper also reasons from its satisfaction to acceptability, and rows_licensing pairs it with the judgments in both directions.
  • Negation is complementation. A numeral sentence asserts a plurality of exactly that many, and a numeral's alternatives are the numerals from one up. The universal and existential determiners are the substrate's.
  • The models instantiate the conjunctions of plural DPs; a judged row is read only when its sentence is one the models instantiate.

Errata

  • The interfering implicature of a collective conjunction is presented as following from Chierchia's (2004) core idea. It follows from the exhaustification the paper attributes to Chierchia (2013), not from the 2004 scalar assertion, which negates only the weakest alternative that asymmetrically entails the sentence; the paper's own observation is that the or-alternative of a collective conjunction does not, so on the 2004 definitions the implicature does not arise (strongApply_andNode_wroteTogether).

TODO

  • The operator-based Revised Additional Restriction and its undergeneration and overgeneration under boolean, non-boolean and ambiguous conjunction; conjunctions of singular and mass DPs, whose or-alternative may be ill-formed; collective universal quantification; always; mixed predicates disambiguated to the collective reading; the movement-based accounts; the pruning constraints.

References

The Revised NPI Licensing Condition

L104–110
L130–132
L134–136

Domains

L151–155

Conjunction

L194–197
L203–205
L211–212
L214–215
L217–218
L221–222

Under negation, any conjoined with a plurality meets the Revised NPI Licensing Condition only if the predicate is not divisive at some world, unless the or-sentence entails the and-sentence; this is a weak form of (9) ((22), (25)).

theorem not_div_of_licensingConditionL236–241
{α : Type u_1} {W : Type u} [SemilatticeSup α] [OrderBot α] {VP : α → Set W} {g n : α} (h : LicensingCondition (fun (x : α) => compl <$> conj VP g x) n) (hor : ¬orSome VP g n ⊆ andSome VP g n) :
¬∀ (w : W), Mereology.DIV fun (x : α) => w ∈ VP x

Built from , , ,

Numerals

L256–258
L260–261
L263–264
L266–269

Under negation, a numeral above one fails the Revised NPI Licensing Condition with a predicate divisive in its plural argument, unless the sentence with one entails the sentence: the alternative with one entails it ((32b), (33)–(34)).

theorem not_licensingCondition_numeralL271–277
{E : Type u_2} {P : Type u_3} {W : Type u} {R : Finset E → P → Set W} {N : Set P} {n : ℕ} (hR : ∀ (y : P) (w : W), Mereology.DIV fun (x : Finset E) => w ∈ R x y) (hn : 1 ≤ n) (hne : ¬someN R 1 N ⊆ someN R n N) :
¬LicensingCondition (fun (x : Set P) => compl <$> numeral R n x) N

Built from , ,

Universal quantifiers

L294–297

The models

L329

The domains of the models

Chierchia's Strong Application and exhaustification

Under doubt, the sentence is a strongest of its alternatives exactly when Chierchia's Strong Application gives it no implicature, provided no alternative is trivial.

theorem minimal_iff_strongApply_doubtL490–508
{W : Type u} {x : Chierchia2004.Meaning (Set W)} (hx : x.ordinary ∈ x.alternatives) (hne : ∀ a ∈ x.alternatives, a ≠ Set.univ) :
Minimal (fun (x_1 : Set W) => x_1 ∈ (compl <$> x.toWithAlternatives).alternatives) x.ordinaryᶜ ↔ (Chierchia2004.doubt.strongApply x).strong = x.ordinaryᶜ

Under negation, strengthening any boys to boy 2 in the girls and any boys wrote a paper together weakens the sentence under Chierchia's Strong Application, which adds no implicature, but not under exhaustification against every alternative the sentence does not entail, whose implicature that the girls or some boys wrote one destroys the downward entailment ((49)).

theorem strongApply_andNode_wroteTogetherL536–573

Built from , , , , ,

Clause (i) without clause (ii)

The judgments