1. Ahlbrandt G., Ziegler M.: Quasi finitely axiomatizable totally categorical theories. Ann. Pure Appl. Logic 30, 63–82 (1986)
2. Bodirsky M.: Constraint Satisfaction Problems with Infinite Templates. In: Creignou, N., Kolaitis, P.G., Vollmer, H. (eds) Complexity of Constraints. Lecture Notes in Computer Science vol. 5250, pp. 196–228. Springer, Berlin (2008)
3. Bodirsky, M., Kára, J.: The complexity of temporal constraint satisfaction problems In: Ladner, R.E., Dwork, C. (eds.) Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC), pp. 29–38. ACM, New York (2008). Journal of the ACM 57, 1–41, (2010)
4. Bodirsky M., Nešetřil J.: Constraint Satisfaction with Countable Homogeneous Templates. J. Log. Comput. 16, 359–373 (2006)
5. Bodirsky, M., Pinsker, M.: All reducts of the random graph are model-complete, (2009, preprint), arXiv: 0903.2553