GENERALIZED QUANTIFIERS AND NATURAL LANGUAGE

GENERALIZED QUANTIFIERS AND NATURAL LANGUAGE

1981 | JON BARWISE AND ROBIN COOPER
Generalized quantifiers, introduced by Mostowski in 1957, are mathematical constructs that extend beyond the standard first-order quantifiers ∀ and ∃. These quantifiers have been studied extensively, with over 200 research papers published. While much of this work has focused on cardinality and topological quantifiers, it has prompted logicians to reconsider traditional quantification theory. Standard first-order logic is inadequate for natural language because it cannot symbolize certain sentences and has a different syntactic structure compared to natural language. Generalized quantifiers provide new insights that align logical syntax more closely with natural language syntax, potentially contributing to linguistic theory. Section 1 discusses generalized quantifiers and their relationship to English syntax. Section 2 develops a logic with generalized quantifiers. Section 3 shows how this logic can be related to a fragment of English syntax. Section 4 explores the implications of generalized quantifiers for natural language theory. Section 5 draws conclusions about the relationship between syntax, semantics, and logic. The paper includes four appendices. Appendix A adds to the syntax fragment from Section 3. Appendix B presents semantic postulates for non-logical determiners. Appendix C contains proofs of quantifier facts. Appendix D classifies English determiners based on semantic categories from Section 4. Some points in Sections 1–3 are similar to Montague's 1974 work, especially in "The Proper Treatment of Quantification in Ordinary English." The paper aims to further develop Montague's treatment of noun phrases without lambda calculus and show its implications for natural language theory. Examples of generalized quantifiers include statements about finite numbers, more than half, and most. These quantifiers cannot be expressed using only ∀ and ∃.Generalized quantifiers, introduced by Mostowski in 1957, are mathematical constructs that extend beyond the standard first-order quantifiers ∀ and ∃. These quantifiers have been studied extensively, with over 200 research papers published. While much of this work has focused on cardinality and topological quantifiers, it has prompted logicians to reconsider traditional quantification theory. Standard first-order logic is inadequate for natural language because it cannot symbolize certain sentences and has a different syntactic structure compared to natural language. Generalized quantifiers provide new insights that align logical syntax more closely with natural language syntax, potentially contributing to linguistic theory. Section 1 discusses generalized quantifiers and their relationship to English syntax. Section 2 develops a logic with generalized quantifiers. Section 3 shows how this logic can be related to a fragment of English syntax. Section 4 explores the implications of generalized quantifiers for natural language theory. Section 5 draws conclusions about the relationship between syntax, semantics, and logic. The paper includes four appendices. Appendix A adds to the syntax fragment from Section 3. Appendix B presents semantic postulates for non-logical determiners. Appendix C contains proofs of quantifier facts. Appendix D classifies English determiners based on semantic categories from Section 4. Some points in Sections 1–3 are similar to Montague's 1974 work, especially in "The Proper Treatment of Quantification in Ordinary English." The paper aims to further develop Montague's treatment of noun phrases without lambda calculus and show its implications for natural language theory. Examples of generalized quantifiers include statements about finite numbers, more than half, and most. These quantifiers cannot be expressed using only ∀ and ∃.
Reach us at info@study.space
[slides] Generalized quantifiers and natural language | StudySpace