A Generalized Quantifier Concept in Computational Complexity Theory

Download PDF
Open Webpage

Heribert Vollmer

Published: 1998, Last Modified: 21 May 2024CoRR 1998EveryoneRevisionsBibTeXCC BY-SA 4.0
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.