A Generalized Quantifier Concept in Computational Complexity Theory
classification
💻 cs.CC
keywords
complexitycomputationalgeneralizedquantifiertheorycircuitsconceptdefinability
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.