Polyadic quantifiers

DOI10.1007/BF00632472zbMath0684.03008MaRDI 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 calculus; generalized quantifiers; linguistics; categorial grammar; polyadic quantifiers; unary quantifiers; iterations of quantifiers

Mathematics Subject Classification ID

68Q45: Formal languages and automata

03B65: Logic of natural languages

03C80: Logic with extra quantifiers and operators

03B99: General logic

03B40: Combinatory logic and lambda calculus

Related Items

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

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