2011/11/06 by Christian Retoré, Retoré, Christian
Computer Science · Mathematics · #FOS: Computer and information sciences #FOS: Mathematics #Logic (math.LO) #Logic in Computer Science (cs.LO) #Logic, programming, and type systems #Semantic Web and Ontologies #cs.LO #math.LO
paper · pdf · doi:10.48550/arxiv.1111.1378
Genius III (2011)
arxiv created 2011/11/06 · openalex publication_date 2011/11/06 · arxiv updated 2011/11/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This paper proposes to compute the meanings associated to sentences with generic NPs corresponding to the most of generalized quantifier. We call these generics specimens and they resemble stereotypes or prototypes in lexical semantics. The meanings are viewed as logical formulae that can be thereafter interpreted in your favorite models. We rather depart from the dominant Fregean single untyped universe and go for type theory with hints from Hilbert epsilon calculus and from medieval philosophy. Our type theoretic analysis bears some resemblance with on going work in lexical semantics. Our model also applies to classical examples involving a class (or a generic element of this class) which is provided by the context. An outcome of this study is that, in the minimalism-contextualism debate, if one adopts a type theoretical view, terms encode the purely semantic meaning component while their typing is pragmatically determined.