Computational Complexity of Polyadic Lifts of Generalized Quantifiers in Natural Language

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


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 10,731
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA
Kent Bach (1982). Semantic Nonspecificity and Mixed Quantifiers. Linguistics and Philosophy 4 (4):593 - 605.
Gilad Ben-Avi & Yoad Winter (2003). Monotonicity and Collective Quantification. Journal of Logic, Language and Information 12 (2):127-151.

View all 43 references

Citations of this work BETA
Similar books and articles
Analytics

Monthly downloads

Added to index

2010-04-03

Total downloads

24 ( #70,617 of 1,098,623 )

Recent downloads (6 months)

3 ( #113,599 of 1,098,623 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Start a new thread
Order:
There  are no threads in this forum
Nothing in this forum yet.