scientific article; zbMATH DE number 1163939
From MaRDI portal
Publication:4395563
The survey begins with an excellent characterization of natural language quantifiers, of general constraints connected with them (CONSERV, EXT, ISOM), and of some results concerning iteration, negations, duals, resumption, cumulation, branching. The second chapter deals with definability of quantifiers, and the last with axiomatizability of properties of (natural language) quantifiers, including syllogistic systems. Proofs are deliberately omitted or only suggested. More than 40 references are given. For the entire collection see [Zbl 0885.00034].
Recommendations
Cited in
(16)- Quantifiers in action. Generalized quantification in query, logical and natural languages
- On the expressive power of monotone natural language quantifiers over finite models
- Binary quantification systems
- The grammar of quantification and the fine structure of interpretation contexts
- Basic quantifier theory
- A uniform framework for rough approximations based on generalized quantifiers
- Strong and weak quantifiers in focused \({\text{NL}}_{\text{CL}}\)
- scientific article; zbMATH DE number 4191602 (Why is no real title available?)
- The Problem of Learning the Semantics of Quantifiers
- scientific article; zbMATH DE number 3908416 (Why is no real title available?)
- scientific article; zbMATH DE number 3939332 (Why is no real title available?)
- scientific article; zbMATH DE number 1163953 (Why is no real title available?)
- What is a quantifier?
- scientific article; zbMATH DE number 5198979 (Why is no real title available?)
- On Barwise and Cooper’s “Generalized Quantifiers and Natural Language”
- Some results on quantifiers
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4395563)
