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 (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 Translate to english
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 11,404
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

No references found.

Citations of this work BETA

No citations found.

Similar books and articles
Marcin Mostowski (1998). Computational Semantics for Monadic Quantifiers. Journal of Applied Non--Classical Logics 8 (1-2):107--121.
Johan Benthem (1989). Polyadic Quantifiers. Linguistics and Philosophy 12 (4):437 - 464.
Analytics

Monthly downloads

Added to index

2011-05-31

Total downloads

15 ( #109,932 of 1,102,989 )

Recent downloads (6 months)

1 ( #297,509 of 1,102,989 )

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.