Aho, A. V. and Ullman, J. D. , Universality of data retrieval languages, Conference record of the sixth ACM symposium on principles of programming languages (San Antonio, Texas, 1979), ACM, New York, 1979, pp. 110–120.
Ajtai, M. and Fagin, R. , Reachability is harder for directed than for undirected graphs, this Journal, vol. 55 (1990), pp. 113–150.
Buchi, J. R. , The monadic second order theory of ω1, Decidable theories II: The monadic second order theory of all countable ordinals (Müller, G. H. and Siefkes, D., editors), Lecture Notes in Mathematics, vol. 328, Springer-Verlag, Berlin, 1973, pp. 1–127.
Chandra, A. and Harel, D. , Structure and complexity of relational queries, Journal of Computer and System Sciences, vol. 25 (1982), pp. 99–128.
Ehrenfeucht, A. , An application of games to the completeness problem for formalized theories, Fundamenta Mathematicae, vol. 49 (1961), pp. 120–141.
Fagin, R. , Generalized first-order spectra and polynomial-time recognizable sets, SIAM-AMS Proceedings (Karp, R., editor), American Mathematical Society, Providence, Rhode Island, vol. 7, 1974, pp. 43–73.
Fagin, R. , Monadic generalized spectra, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, vol. 21 (1975), pp. 89–96.
Grohe, M. , Bounded-arity hierarchies in fixedpoint logic, Ph.D.thesis, Universität Freiburg, Freiburg, 1993.
Harel, D. and Kozen, D. , A programming language for the inductive sets, and applications, Information and Control, vol. 63 (1984), pp. 118–139.
Immerman, N. , Number of quantifiers is better than number of tape cells, Journal of Computer and System Sciences, vol. 22 (1981), pp. 384–406.
Immerman, N. , Upper and lower bounds for first order expressibility, Journal of Computer and System Sciences, vol. 25 (1982), pp. 76–98.
Immerman, N. , Relational queries computable in polynomial time, Information and Control, vol. 68 (1986), pp. 86–104.
Immerman, N. , Languages that capture complexity classes, SIAM Journal on Computing, vol. 16 (1987), pp. 760–778.
Kolaitis, P. G. and Vardi, M. Y. , On the expressive power of datalog: tools and a case study, Proceedings of the ninth ACM symposium on the principles of database systems (Nashville, Tennessee, 1990), ACM, New York, 1990, pp. 61–71.
Ladner, R. E. , Application of model theoretic games to discrete linear orders and finite automata, Information and Control, vol. 33 (1977), pp. 281–303.
Lakshmanan, V. S. and Mendelzon, A. O. , Inductive pebble games and the expressive powers of datalog, Proceedings of the eighth ACM symposium on the principles of database management, ACM, New York, 1989, pp. 301–310.
McColm, G.L. , Some restrictions on simple fixed points of the integers, this Journal, vol. 54 (1989), pp. 1324–1345.
McColm, G.L. , Parametrization over inductive relations of a bounded number of variables, Annals of Pure and Applied Logic, vol. 48 (1990), pp. 103–134.
McColm, G. L. , Eventual periodicity and “one-dimensional”queries, Notre Dame Journal of Formal Logic, vol. 33 (1992), pp. 273–290.
McColm, G. L. [1995A], Dimension versus number of variables, and connectivity, too, Mathematical Logic Quarterly (to appear).
McColm, G. L. [1995B], Pebble games and lease simple fixed points, Information and Computation (to appear).
Moschovakis, Y. N. , The game quantifier, Proceedings of the American Mathematical Society, vol. 31 (1971), pp. 245–250.
Moschovakis, Y. N. , Elementary induction on algebraic structures, North-Holland, Amsterdam, 1974.
Moschovakis, Y. N. , Abstract recursion as a foundation for the theory of algorithms Computation and proof theory, Logic Colloquium ’;83, Aachen (Richter, M. M.et al., editors), Lecture Notes in Mathematics, vol. 1104, Springer-Verlag, Berlin, 1983, pp. 289–364.
Stolboushkin, A. P. , Finitely monotone properties, unpublished manuscript.
Vardi, M. , Complexity of relational database systems, Fourteenth annual ACM symposium on the theory of computing (San Francisco, California, 1982), ACM, New York, 1982, pp. 137–146.