Variable types for meaning assembly: a logical syntax for generic noun phrases introduced by most
It addresses a specific issue in formal semantics and pragmatics for linguists and logicians, offering an incremental contribution by integrating type theory with existing work.
This paper tackles the problem of computing meanings for sentences with generic noun phrases like 'most', proposing a type-theoretic approach that departs from the Fregean view, resulting in a model where terms encode semantic meaning and their typing is pragmatically determined.
This paper proposes a way to compute the meanings associated with sentences with generic noun phrases corresponding to the generalized quantifier most. We call these generics specimens and they resemble stereotypes or prototypes in lexical semantics. The meanings are viewed as logical formulae that can thereafter be interpreted in your favourite models. To do so, we depart significantly from the dominant Fregean view with a single untyped universe. Indeed, our proposal adopts type theory with some hints from Hilbert ε-calculus (Hilbert, 1922; Avigad and Zach, 2008) and from medieval philosophy, see e.g. de Libera (1993, 1996). Our type theoretic analysis bears some resemblance with ongoing work in lexical semantics (Asher 2011; Bassac et al. 2010; Moot, Prévot and Retoré 2011). Our model also applies to classical examples involving a class, or a generic element of this class, which is not uttered but provided by the context. An outcome of this study is that, in the minimalism-contextualism debate, see Conrad (2011), if one adopts a type theoretical view, terms encode the purely semantic meaning component while their typing is pragmatically determined.