Retracted: The Witness Set Constraint. (27th July 2016)

• Record Type: Journal Article
• Authors: Fortuny, Jordi
• Is Part Of: Journal of semantics. Volume 34:Number 2(2017:May)
• Page Start: e1
• Page End: e1
• Publication Date: 2016-07-27
• Subjects: Semantics -- Periodicals; Semantik; Semantics; Periodicals; 401.43
• DOI: 10.1093/jos/ffw009
• Languages: English
• ISSNs: 0167-5133

Abstract

Abstract: This article is initially concerned with a famous constraint on the class of possible determiners in natural languages: the so-called Conservativity Constraint. We shall briefly illustrate the force of this constraint and informally sketch Keenan & Stavi (1986) 's view according to which the Conservativity Constraint derives from the boolean structure of natural language semantics. We shall proceed to discuss certain well-known linguistic categories that have been argued to be interpreted by non-conservative functions: only and the relative proportional determiners many and few . We shall take the challenge posed by the existence of these categories in order to propose an alternative to the Conservativity Constraint. This alternative will be dubbed the Witness Set Constraint, which is inspired in Barwise & Cooper (1981) 's considerations on the semantic processing of generalized quantifiers. We shall defend that the proposed constraint does not suffer from the empirical shortcomings that have been attributed to the Conservativity Constraint, and indeed, we shall argue in detail that it correctly predicts (i) the existence of conservative determiners, (ii) the non-existence of certain non-conservative determiners, such as inner negations, cardinal comparison determiners and the converses of non-trivial proportional determiners, and most importantly, (iii) the existence of the non-conservative functions denoted by only and the relative proportional determiners many and few . This line of reasoning suggests that the class of functions from properties to sets of properties denoted in natural languages typically by determiners is constrained by a principle that simplifies the semantic processing of generalized quantifiers.