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)
  Copy   BIBTEX

Abstract

We prove that PTIME generalized quantifiers are closed under Boolean operations, iteration, cumulation and resumption.

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Computational Complexity of Polyadic Lifts of Generalized Quantifiers in Natural Language.Jakub Szymanik - 2010 - Linguistics and Philosophy 33 (3):215-250.
Definability of polyadic lifts of generalized quantifiers.Lauri Hella, Jouko Väänänen & Dag Westerståhl - 1997 - Journal of Logic, Language and Information 6 (3):305-335.
Characterizing Definability of Second-Order Generalized Quantifiers.Juha Kontinen & Jakub Szymanik - 2011 - 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.
Understanding Quantifiers in Language.Jakub Szymanik & Marcin Zajenkowski - 2009 - In N. A. Taatgen & H. van Rijn (eds.), Proceedings of the 31st Annual Conference of the Cognitive Science Society.
A generalized quantifier concept in computational complexity theory.Heribert Vollmer - 1999 - In Generalized Quantifiers and Computation (Aix-En-Provence, 1997). Springer. pp. 99--123.
Improving Methodology of Quantifier Comprehension Experiments.Jakub Szymanik & Marcin Zajenkowski - 2009 - Neuropsychologia 47 (12):2682--2683.
Computational Semantics for Monadic Quantifiers.Marcin Mostowski - 1998 - Journal of Applied Non--Classical Logics 8 (1-2):107--121.
A Computational Approach to Quantifiers as an Explanation for Some Language Impairments in Schizophrenia.Marcin Zajenkowski, Rafał Styła & Jakub Szymanik - 2011 - Journal of Communication Disorder 44:2011.
Quantifiers and Working Memory.Jakub Szymanik & Marcin Zajenkowski - 2010 - In Maria Aloni & Katrin Schulz (eds.), Amsterdam Colloquium 2009, LNAI 6042. Springer.
Quantifiers in TIME and SPACE. Computational Complexity of Generalized Quantifiers in Natural Language.Jakub Szymanik - 2009 - Dissertation, University of Amsterdam
Polyadic quantifiers.Johan Benthem - 1989 - Linguistics and Philosophy 12 (4):437 - 464.
Hierarchies of monadic generalized quantifiers.Kerkko Luosto - 2000 - Journal of Symbolic Logic 65 (3):1241-1263.
Against binary quantifiers.Fred Landman - 2000 - In Events and Plurality. Kluwer Academic Publisher. pp. 310--349.

Analytics

Added to PP
2011-05-31

Downloads
59 (#266,556)

6 months
7 (#411,886)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Jakub Szymanik
University of Amsterdam

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references