Polyadic quantifiers
Linguistics and Philosophy 12 (4):437 - 464 (1989)
| Abstract | This article has no associated abstract. (fix it) | |||||||||
| Keywords | generalized quantifiers | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,672 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesJohan van Benthem (1987). Towards a Computational Semantics. In Peter Gärdenfors (ed.), Generalized Quantifiers. Reidel Publishing Company.
Henriëtte De Swart & Ivan A. Sag (2002). Negation and Negative Concord in Romance. Linguistics and Philosophy 25 (4):373-417.
Henriëtte De Swart & Ivan A. Sag (2002). Negation and Negative Concord in Romance. Linguistics and Philosophy 25 (4):373 - 417.
Jakub Szymanik (2010). Computational Complexity of Polyadic Lifts of Generalized Quantifiers in Natural Language. Linguistics and Philosophy 33 (3):215-250.
Jakub Szymanik (2010). Almost All Complex Quantifiers Are Simple. In C. Ebert, G. Jäger, M. Kracht & J. Michaelis (eds.), Mathematics of Language 10/11, Lecture Notes in Computer Science 6149. Springer.
Fred Landman (2000). Against Binary Quantifiers. In Events and Plurality. Kluwer Academic Publisher.
Tarek Sayed Ahmed (2008). On Complete Representations of Reducts of Polyadic Algebras. Studia Logica 89 (3):325 - 332.
Lauri Hella, Jouko Väänänen & Dag Westerståhl (1997). Definability of Polyadic Lifts of Generalized Quantifiers. Journal of Logic, Language and Information 6 (3):305-335.
Johan van Benthem & Dag Westerståhl (1995). Directions in Generalized Quantifier Theory. Studia Logica 55 (3):389-419.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads6 ( #145,547 of 549,065 )Recent downloads (6 months)2 ( #37,252 of 549,065 )How can I increase my downloads? |
My notes
Discussion
