Almost all complex quantifiers are simple

Authors
Publication date 2010
Host editors
  • C. Ebert
  • G. Jäger
  • J. Michaelis
Book title The Mathematics of Language
Book subtitle 10th and 11th Biennial Conference MOL 10, Los Angeles, CA, USA, July 28-30, 2007 and MOL 11, Bielefeld, Germany, August 20-21, 2009 : revised selected papers
ISBN
  • 9783642143212
ISBN (electronic)
  • 9783642143229
Series Lecture Notes in Computer Science
Event 11th Meeting on the Mathematics of Language (MOL 11), Bielefeld, Germany
Pages (from-to) 272-280
Publisher Berlin: Springer
Organisations
  • Interfacultary Research - Institute for Logic, Language and Computation (ILLC)
Abstract We prove that PTIME generalized quantifiers are closed under Boolean operations, iteration, cumulation and resumption.
Document type Conference contribution
Language English
Related publication Almost all complex quantifiers are simple
Published at https://doi.org/10.1007/978-3-642-14322-9_21
Permalink to this page
Back