On computing Boolean connectives of characteristic functions. Generalized quantifiers and logical reducibilities. Definability hierarchies of generalized quantifiers. IEEE Computer Society Press. Languages that capture complexity classes.
Nondeterministic space is closed under complementation.
Generalized quantifiers and pebble games on finite structures. Richard E. Ladner and Nancy A. Lynch. Relativization of questions about log space computability. R. E. Ladner, N. A. Lynch, and A. L. Selman. A comparison of polynomial time reducibilities.