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 (2010)
| Abstract | We prove that PTIME generalized quantifiers are closed under Boolean operations, iteration, cumulation and resumption. | |||||||||
| Keywords | generalized quantifiers computational complexity polyadic quantifiers Boolean combinations iteration cumulation resumption | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,631 |
| External links |
  Try with proxy. |
| Through your library | Configure |
Similar books and articlesJakub Szymanik (2010). Computational Complexity of Polyadic Lifts of Generalized Quantifiers in Natural Language. Linguistics and Philosophy 33 (3):215-250.
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.
Juha Kontinen & Jakub Szymanik (2011). Characterizing Definability of Second-Order Generalized Quantifiers. In L. Beklemishev & R. de Queiroz (eds.), Proceedings of the 18th Workshop on Logic, Language, Information and Computation, Lecture Notes in Artificial Intelligence 6642. Springer.
Jakub Szymanik & Marcin Zajenkowski (2009). Comprehension of Simple Quantifiers. Empirical Evaluation of a Computational Model. Cognitive Science: A Multidisciplinary Journal 34 (3):521-532.
Jakub Szymanik & Marcin Zajenkowski (2009). Understanding Quantifiers in Language. In N. A. Taatgen & H. van Rijn (eds.), Proceedings of the 31st Annual Conference of the Cognitive Science Society.
Heribert Vollmer (1999). A Generalized Quantifier Concept in Computational Complexity Theory. In Generalized Quantifiers and Computation (Aix-En-Provence, 1997). Springer.
Jakub Szymanik & Marcin Zajenkowski (2009). Improving Methodology of Quantifier Comprehension Experiments. Neuropsychologia 47 (12):2682--2683.
Marcin Mostowski (1998). Computational Semantics for Monadic Quantifiers. Journal of Applied Non--Classical Logics 8:107--121.
Marcin Zajenkowski, Rafał Styła & Jakub Szymanik (2011). A Computational Approach to Quantifiers as an Explanation for Some Language Impairments in Schizophrenia. Journal of Communication Disorder 44:2011.
Jakub Szymanik & Marcin Zajenkowski (2010). Quantifiers and Working Memory. In Maria Aloni & Katrin Schulz (eds.), Amsterdam Colloquium 2009, LNAI 6042. Springer.
Jakub Szymanik (2009). Quantifiers in TIME and SPACE. Computational Complexity of Generalized Quantifiers in Natural Language. Dissertation, University of Amsterdam
Johan Benthem (1989). Polyadic Quantifiers. Linguistics and Philosophy 12 (4):437 - 464.
Kerkko Luosto (2000). Hierarchies of Monadic Generalized Quantifiers. Journal of Symbolic Logic 65 (3):1241-1263.
Fred Landman (2000). Against Binary Quantifiers. In Events and Plurality. Kluwer Academic Publisher.
Analytics
Monthly downloads |
Added to index2011-05-31Total downloads15 ( #78,526 of 548,951 )Recent downloads (6 months)5 ( #15,091 of 548,951 )How can I increase my downloads? |
My notes
Discussion
