Some generalised comparative determiners

Abstract. Functions denoted by specific comparative expressions called generalised comparative determiners are analysed. These expressions form verb arguments when applied to common nouns. They denote functions which take sets and a binary relation as argument and give a set as re-sult. These functions are thus different from denotations of ”ordinary” determiners. However, they do obey some similar constraints, properly generalised. It is shown that verbal arguments obtained from such gen-eralised determiners extend the expressive power of NLs since functions that they denote are not just case extensions of type 〈1 〉 quantifiers used to interpret ”ordinary ” determiner phrases.