1. A. Andersson, Lindström quantifiers and higher-order notions on finite structures, Ph.D. Thesis, Uppsala University, 1999.
2. H.-J. Burtschick, H. Vollmer, Lindström quantifiers and leaf language definability, Electron. Colloq. Comput. Complexity TR96-005, 1996.
3. Extended logics;Ebbinghaus,1985
4. R. Fagin, Generalized first-order spectra and polynomial-time recognizable sets, in: R.M. Karp (Ed.), Complexity of Computation, SIAM-AMS Proceedings, Vol. 7, 1974, pp. 43–73.
5. On monadic NP vs. monadic co-NP;Fagin;Inform. Comput.,1995