Computational Complexity of Polyadic Lifts of Generalized Quantifiers in Natural Language

Linguistics and Philosophy 33 (3):215-250 (2010)
Authors
Jakub Szymanik
University of Amsterdam
Abstract
We study the computational complexity of polyadic quantifiers in natural language. This type of quantification is widely used in formal semantics to model the meaning of multi-quantifier sentences. First, we show that the standard constructions that turn simple determiners into complex quantifiers, namely Boolean operations, iteration, cumulation, and resumption, are tractable. Then, we provide an insight into branching operation yielding intractable natural language multi-quantifier expressions. Next, we focus on a linguistic case study. We use computational complexity results to investigate semantic distinctions between quantified reciprocal sentences. We show a computational dichotomy<br>between different readings of reciprocity. Finally, we go more into philosophical speculation on meaning, ambiguity and computational complexity. In particular, we investigate a possibility to<br>revise the Strong Meaning Hypothesis with complexity aspects to better account for meaning shifts in the domain of multi-quantifier sentences. The paper not only contributes to the field of the formal<br>semantics but also illustrates how the tools of computational complexity theory might be successfully used in linguistics and philosophy with an eye towards cognitive science.
Keywords generalized quantifiers  computational complexity theory  polyadic quantification  multi quantifier sentences  Stron Meaning Hypothesis
Categories (categorize this paper)
Reprint years 2011
DOI 10.1007/s10988-010-9076-z
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 33,208
Through your library

References found in this work BETA

Generalized Quantifiers and Natural Language.John Barwise & Robin Cooper - 1981 - Linguistics and Philosophy 4 (2):159--219.
Über Sinn und Bedeutung.Gottlob Frege - 1892 - Zeitschrift für Philosophie Und Philosophische Kritik 100 (1):25--50.

View all 44 references / Add more references

Citations of this work BETA

Iterating Semantic Automata.Shane Steinert-Threlkeld & I. I. I. Thomas F. Icard - 2013 - Linguistics and Philosophy 36 (2):151-173.

View all 8 citations / Add more citations

Similar books and articles

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.

Analytics

Added to PP index
2010-04-03

Total downloads
72 ( #84,718 of 2,242,594 )

Recent downloads (6 months)
2 ( #231,979 of 2,242,594 )

How can I increase my downloads?

Monthly downloads

My notes

Sign in to use this feature