Abiteboul, S. and Vianu, V., Generic computation and its complexity, Proceedings of the 23rd ACM Symposium on Theory of Computing, 1991, pp. 209–219.
Blass, A. and Gurevich, Y., Strong extension axioms and Shelah's zero-one law for choiceless polynomial time, to appear.
Blass, A., Equivalence relations, invariants, and normal forms, SIAM Journal on Computing, vol. 13 (1984), pp. 682–689.
Blass, A., Equivalence relations, invariants, and normal forms, II, Logic and Machines: Decision Problems and Complexity (Börger, E., Hasenjaeger, G., and Rödding, D., editors), Lecture Notes in Computer Science, vol. 171, Springer-Verlag, 1984, pp. 24–42.
Blass, A., Gurevich, Y., and den Bussche, J. V., Abstract state machines and computationally complete query languages, Information and Computation, An abridged version appeared in Abstract State Machines: Theory and Applications, (Gurevich, Y., Kutter, P., Odersky, M., and Thiele, L., editors). Lecture Notes in Computer Science, vol. 1912, Spinger-Verlag, 2000, pp. 22–33.
Blass, A., Gurevich, Y., and Shelah, S., Choiceless polynomial time, Annals of Pure and Applied Logic, vol. 100 (1999), pp. 141–187.
Bollobás, B., Graph Theory: An Introductory Course, Springer-Verlag, 1979.
Cai, J. Y., Fürer, M., and Immerman, N., An optimal lower bound on the number of variables for graph identification, Combinatorica, vol. 12 (1992), pp. 389–410.
Chandra, A. and Harel, D., Structure and complexity of relational queries, Journal of Computer and System Sciences, vol. 25 (1982), pp. 99–128.
Gire, F. and Hoang, H. A, An extension of fixpoint logic with a symmetry-based choice construct, Information and Computation, vol. 144 (1998), pp. 40–65.
Grädel, E. and Gurevich, Y., Metafinite model theory, Information and Computation, vol. 140 (1998), pp. 26–81.
Gurevich, Y., Logic and the challenge of computer science, Current trends in theoretical computer science (Börger, E., editor). Computer Science Press, 1988, pp. 1–57.
Gurevich, Y., Evolving algebras 1993: Lipari guide, Specification and validation methods (Börger, E., editor), Oxford University Press, 1995, pp. 9–36.
Gurevich, Y., From invariants to canonization, Bulletin of the European Association on Theoretical Computer Science, vol. 63 (1997), Also as Logic in Computer Science, in Current trends in theoretical computer science: Entering the 21st century, (Paun, G., Rozenberg, G. and Salomaa, A., editors). World Scientific, 2001, pp. 233–436.
Gurevich, Y. and Shelah, S., On finite rigid structures, this Journal, vol. 61 (1996), pp. 549–562.
Immerman, N., Relational queries computable in polynomial time, Information and Control, vol. 68 (1986), pp. 86–104.
Otto, M., Bounded variable logics and counting: A study in finite models, Lecture Notes in Logic, vol. 9, Springer-Verlag, 1997.
Shelah, S., Choiceless polynomial time logic: Inability to express, Computer Science Logic 2000 (Clote, P. and Schwichtenberg, H., editors), Lecture Notes in Computer Science, vol. 1862, Springer-Verlag, 2000, paper number 634, pp. 72–125.
Vardi, M., The complexity of relational query languages, Proceedings of the 14th ACM Symposium on Theory of Computing, 1982, pp. 137–146.