Computational Complexity of Polyadic Lifts of Generalized Quantifiers in Natural Language

Linguistics and Philosophy 33 (3):215-250 (2010)
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
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 30,780
Through your library
References found in this work BETA
Generalized Quantifiers and Natural Language.Jon Barwise & Robin Cooper - 1981 - Linguistics and Philosophy 4 (2):159--219.
The Principles of Mathematics Revisited.Jaakko Hintikka - 1996 - Cambridge University Press.

View all 43 references / Add more references

Citations of this work BETA
Relational Domains and the Interpretation of Reciprocals.Sivan Sabato & Yoad Winter - 2012 - Linguistics and Philosophy 35 (3):191-241.
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.
Added to PP index

Total downloads
72 ( #80,235 of 2,214,632 )

Recent downloads (6 months)
2 ( #239,034 of 2,214,632 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature