In formal semantics, a generalized quantifier (GQ) is an expression that denotes a set of sets. This is the standard semantics assigned to quantified noun phrases. For example, the generalized quantifier every boy denotes the set of sets of which every boy is a member: This treatment of quantifiers has been essential in achieving a compositional semantics for sentences containing quantifiers. A version of type theory is often used to make the semantics of different kinds of expressions explicit. The standard construction defines the set of types recursively as follows: e and t are types. If a and b are both types, then so is Nothing is a type, except what can be constructed on the basis of lines 1 and 2 above. Given this definition, we have the simple types e and t, but also a countable infinity of complex types, some of which include: Expressions of type e denote elements of the universe of discourse, the set of entities the discourse is about. This set is usually written as . Examples of type e expressions include John and he. Expressions of type t denote a truth value, usually rendered as the set , where 0 stands for "false" and 1 stands for "true". Examples of expressions that are sometimes said to be of type t are sentences or propositions. Expressions of type denote functions from the set of entities to the set of truth values. This set of functions is rendered as . Such functions are characteristic functions of sets. They map every individual that is an element of the set to "true", and everything else to "false." It is common to say that they denote sets rather than characteristic functions, although, strictly speaking, the latter is more accurate. Examples of expressions of this type are predicates, nouns and some kinds of adjectives. In general, expressions of complex types denote functions from the set of entities of type to the set of entities of type , a construct we can write as follows: . We can now assign types to the words in our sentence above (Every boy sleeps) as follows.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Related publications (1)
Related concepts (9)
Determiner
A determiner, also called determinative (abbreviated ), is a word, phrase, or affix that occurs together with a noun or noun phrase and generally serves to express the reference of that noun or noun phrase in the context. That is, a determiner may indicate whether the noun is referring to a definite or indefinite element of a class, to a closer or more distant element, to an element belonging to a specified person or thing, to a particular number or quantity, etc.
Formal semantics (natural language)
Formal semantics is the study of grammatical meaning in natural languages using formal tools from logic, mathematics and theoretical computer science. It is an interdisciplinary field, sometimes regarded as a subfield of both linguistics and philosophy of language. It provides accounts of what linguistic expressions mean and how their meanings are composed from the meanings of their parts. The enterprise of formal semantics can be thought of as that of reverse-engineering the semantic components of natural languages' grammars.
Grammatical modifier
In linguistics, a modifier is an optional element in phrase structure or clause structure which modifies the meaning of another element in the structure. For instance, the adjective "red" acts as a modifier in the noun phrase "red ball", providing extra details about which particular ball is being referred to. Similarly, the adverb "quickly" acts as a modifier in the verb phrase "run quickly". Modification can be considered a high-level domain of the functions of language, on par with predication and reference.
Show more

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.