1. The Closure of Monadic NP
2. Sanjeev Arora and Boaz Barak. 2009. Computational Complexity - A Modern Approach. Cambridge University Press. http://www.cambridge.org/catalogue/catalogue.asp?isbn=9780521424264
3. What can be verified locally?
4. Identifiers in Registers
5. Ronald Fagin. 1974. Generalized First-Order Spectra and Polynomial-Time Recognizable Sets. In Complexity of Computation (SIAM-AMS Proceedings, Vol. 7), Richard M. Karp (Ed.). 43--73.