Polyadic quantifiers

DOI10.1007/BF00632472zbMath0684.03008OpenAlexW4243337515MaRDI QIDQ4733854

J. F. A. K. van Benthem

Publication date: 1989

Published in: Linguistics and Philosophy (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00632472

zbMATH Keywords

lambda calculusgeneralized quantifierslinguisticscategorial grammarpolyadic quantifiersunary quantifiersiterations of quantifiers

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic of natural languages (03B65) Logic with extra quantifiers and operators (03C80) General logic (03B99) Combinatory logic and lambda calculus (03B40)

Related Items (14)

Natural language, sortal reducibility and generalized quantifiers ⋮ A generalized quantifier logic for naked infinitives ⋮ Independent set readings and generalized quantifiers ⋮ Beyond the frege boundary ⋮ Directions in generalized quantifier theory ⋮ An analysis of existential graphs. II: Beta ⋮ Self-commuting quantifiers ⋮ Did Tarski commit “Tarski's fallacy”? ⋮ Incremental interpretation ⋮ Partially-ordered (branching) generalized quantifiers: A general definition ⋮ Scopeless quantifiers and operators ⋮ Some properties of iterated languages ⋮ Scope dominance with monotone quantifiers over finite domains ⋮ Interpretation and inference with maximal referential terms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Harvey Friedman's research on the foundations of mathematics
• Essays in logical semantics
• On branching quantifiers in English
• On a generalization of quantifiers
• Questions about quantifiers
• A semantic characterization of natural language determiners
• Generalized quantifiers and natural language

This page was built for publication: Polyadic quantifiers