1. Blass, A., & Gurevich, Y. (1986). Henkin quantifiers and complete problems. Annals of Pure and Applied Logic, 32, 1–16.
2. Ebbinghaus, H.-D., & Flum, J. (2005). Finite Model Theory. Springer Monographs in Mathematics. Berlin: Springer.
3. Fagin, R. (1974). Generalized first-order spectra and polynomial time recognizable sets. In R. Karp (Ed.), Complexity of Computation. SIAM–AMS Proceedings (Vol. 7, pp. 43–73). American Mathematical Society.
4. Garey, M. R., & Johnson, D. S. (1990). Computers and Intractability. A Guide to the Theory of NP-Completeness. New York, NY: W. H. Freeman.
5. Gottlob, G., Leone, N., & Veith, H. (1999). Succinctness as a source of complexity in logical formalisms. Annals of Pure and Applied Logic, 97, 231–260.