1. Studies in Logic and Practical Reasoning;P. Blackburn,2006
2. Chagrov, A.V., Rybakov, M.N.: How many variables does one need to prove PSPACE-hardness of modal logics. In: Balbiani, P., Suzuki, N.-Y., Wolter, F., Zakharyaschev, M. (eds.) Advances in Modal Logic, pp. 71–82. King’s College Publications, London (2002)
3. Courcelle, B.: The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Inf. Comput. 85(1), 12–75 (1990)
4. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Berlin (1999)
5. Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning About Knowledge. MIT Press, Cambridge (1995)