A Generalized Quantifier Concept in Computational Complexity Theory
<|reference_start|>A Generalized Quantifier Concept in Computational Complexity Theory: 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.<|reference_end|>
@article{vollmer1998a,
    title={A Generalized Quantifier Concept in Computational Complexity Theory},
    author={Heribert Vollmer},
    journal={arXiv preprint arXiv:cs/9809115},
    year={1998},
    archivePrefix={arXiv},
    eprint={cs/9809115},
    primaryClass={cs.CC}
}