Almost all complex quantifiers are simple
| Authors | |
|---|---|
| Publication date | 2009 |
| Event | 11th Meeting on the Mathematics of Language (MOL 11), Bielefeld, Germany |
| Number of pages | 9 |
| Organisations |
|
| Abstract | We prove that PTIME generalized quantifiers are closed under Boolean operations, iteration, cumulation and resumption. |
| Document type | Paper |
| Language | English |
| Related publication | Almost all complex quantifiers are simple |
| Published at | http://www.jakubszymanik.com/papers/complex_qua.pdf |
| Downloads |
315538.pdf
(Final published version)
|
| Permalink to this page | |
