Almost All Complex Quantifiers Are Simple

Look Inside Get Access

Find out how to access preview-only content

The Mathematics of Language

Lecture Notes in Computer Science Volume 6149, 2010, pp 272-280

Buy this eBook

* Final gross prices may vary according to local VAT.

Get Access

Abstract

We prove that PTIME generalized quantifiers are closed under Boolean operations, iteration, cumulation and resumption.

To view the rest of this content please follow the download PDF link above.