Affordable Access

A Generalized Quantifier Concept in Computational Complexity Theory

Authors
  • Vollmer, Heribert
Type
Preprint
Publication Date
Sep 28, 1998
Submission Date
Sep 28, 1998
Identifiers
arXiv ID: cs/9809115
Source
arXiv
License
Unknown
External links

Abstract

A notion of generalized quantifier in computational complexity theory is explored and used to give a unified treatment of leaf language definability, oracle separations, type 2 operators, and circuits with monoidal gates. Relations to Lindstroem quantifiers are pointed out.

Report this publication

Statistics

Seen <100 times