Universal 1205:
- Original
- Persistent determiner constraint:
Every persistent determiner of human language is monotone ¡ncreasing and weak. - Standardized
- Persistent determiner constraint:
Every persistent determiner of human language is monotone ¡ncreasing and weak. - Keywords
- quantification, monotonicity, persistence, determiner
- Domain
- syntax, semantics
- Type
- unconditional
- Status
- achronic
- Quality
- absolute
- Basis
- unspecified
- Source
- Barwise & Cooper 1981: 193, U8
- Counterexamples
1. For technical reasons, the following logical relations are abbreviated as follows: A is a subset of E = A $ E; X is a member of set Q = X % Q. 2. A determiner D is ‘persistent’ if for all M = and all A $ B $ E, if X % ||D|| (A) then X % ||D|| (B). On the other hand, D is anti-persistent if A $ B $ E and X $ ||D|| (B) implies X $ ||D|| (A).)English examples for persistent determiners are ‘some’, ‘at least n’, ‘infinitely many’, ‘uncountably many’ etc., for anti-persistent determiners ‘every’, ‘no’, ‘at most n’, ‘finitely many’ etc.