1. Ajtai, M., Fagin, R., Stockmeyer, L.: The Closure of Monadic
$\cal NP$
. In: Proc. of 13th STOC, pp. 309–318 (1998)
2. Lecture Notes in Computer Science;L. Cardelli,2002
3. Courcelle, B.: Graph rewriting: An algebraic and logic approach. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. 2, pp. 194–242. Elsevier Science Publishers, Amsterdam (1990)
4. Dawar, A., Gardner, P., Ghelli, G.: Expressiveness and Complexity of Graph Logic, Imperial College, Department of Computing Technical Report 2004/3, Information and Computation (to appear)
5. Ebinghaus, H.-D., Flum, J.: Finite Model Theory. Springer, Heidelberg (1995)