Found:

Strength

**SEMANTICS: **a property of **determiner**s and **generalized quantifier**s in
**Generalized Quantifier Theory**. An NP is *positive strong* if and only if its denotation (a set of sets) always contains the denotation of the CN (common noun). An NP is negative strong if and only if its denotation never contains the denotation of the CN. An NP which is neither positive nor negative strong is called weak. Sentences of the form in (i) provide a test for strength of a determiner D:

(i) [If the sentence is true in every model, D is positive strong (_{S}[_{NP}DET CN] is a CN/are CN's]

(ii) *There is every dog in the garden. (iii) *There is neither dog in the garden. (iv) There are at least two dogs in the garden.See also

LIT. | Barwise, J. & R. Cooper (1981) Gamut, L.T.F. (1991) Zwarts, F. (1981) |