A Generalized Quantifier Concept in Computational Complexity Theory

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 Lindström quantifiers are pointed out. 
DOI: 10.1007/3-540-46583-9_5

Topics

Cite this paper

@inproceedings{Vollmer1997AGQ, title={A Generalized Quantifier Concept in Computational Complexity Theory}, author={Heribert Vollmer}, booktitle={ESSLLI}, year={1997} }