Live briefing
Everything about Generalized quantifier
Expression denoting a set of sets in formal semantics
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. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Generalized quantifierA 5-minute orientation
- Skim a recent paper: Against a generalized quantifier analysis of certain quantity expressions in Ch’olInfluential work since 2022
- Pick up a classic book: Intermediate quantitiesThe most-reprinted book on the subject
- Read the landmark paper: Neural basis for generalized quantifier comprehensionCited 56 times
- Go sideways: Lindström quantifierA closely related topic
- Go sideways: First-order logicA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Neural basis for generalized quantifier comprehension
Skolem-type normal forms for first-order languages with a generalized quantifier
‘Only’ as a Determiner and as a Generalized Quantifier
Some Properties of Natural Language Quantifiers: Generalized Quantifier Theory
A generalized quantifier logic for naked infinitives
The relative contributions of frontal and parietal cortex for generalized quantifier comprehension
Directions in generalized quantifier theory
Generalized quantum similarity in atomic systems: A quantifier of relativistic effects
🆕 Influential since 2022
📚 Books worth reading
Intermediate quantitiesPhilip L. Peterson · 2000
What countsElena Herburger · 2000
Reference and quantificationFrancis Jeffry Pelletier · 2005
Taking scopeMark Steedman · 2011- 📕The Grammar of quantificationRobert May · 1982
Quantifiers and CognitionJakub Szymanik · 2016
Entities and indicesCresswell, M. J. · 1990
Complex demonstrativesJeffrey C. King · 2001
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Lindström quantifier In mathematical logic, a Lindström quantifier is a generalized polyadic quantifier. Lindström quantifiers generalize first-order quantifiers, such as the…
- First-order logic In mathematics, philosophy, linguistics, and computer science, first-order logic (FOL), also called predicate logic, predicate calculus, or quantificational…
- Model theory In mathematical logic, model theory is the study of the relationship between formal theories (a collection of sentences in a formal language expressing…
- Dependence logic Dependence logic is a logical formalism, created by Jouko Väänänen, which adds dependence atoms to the language of first-order logic. A dependence atom…
- Structure (mathematical logic) In universal algebra and in model theory, a structure consists of a set along with a collection of finitary operations and relations that are defined on…
- Second-order logic In logic and mathematics, second-order logic is an extension of first-order logic, which itself is an extension of propositional logic. Second-order logic…
- Interpretation (logic) An interpretation is an assignment of meaning to the symbols of a formal language. Many formal languages used in mathematics, logic, and theoretical computer…
- Turnstile (symbol) In mathematical logic and computer science the symbol ⊢ (⊢) has taken the name turnstile because of its resemblance to a typical turnstile. It is also…