Abiteboul, S. Vardi, M. Y. and Vianu, V. Fixpoint logics, relational machines, and computational complexity. In Proc. 7th IEEE Symp. on Structure in Complexity Theory, 1992.Google Scholar

Abiteboul, S. and Vianu, V. Datalog extensions for database queries and updates. Journal of Computer and System Sciences, 43:62–124, 1991.Google Scholar

Abiteboul, S. and Vianu, V. Computing with first-order logic. Journal of Computer and System Sciences, 50(2):309–335, 1995.Google Scholar

Barwise., J. On Moschovakis closure ordinals. Journal of Symbolic Logic, 42:292–296, 1977.Google Scholar

Dawar., A. Feasible Computation through Model Theory. PhD thesis, University of Pennsylvania, 1993.

Dawar., A. A restricted second order logic for finite structures. In Leivant, D. editor. Logic and Computational Complexity, volume 960 of LNCS, pages 393–413. Springer-Verlag, 1995.

Dawar, A. Hella, L. and Kolaitis, Ph. G. Implicit definability and infinitary logic in finite model theory. In Fülop, Z. and Gécseg, F. editors, ICALP95, volume 944 of LNCS, pages 624–635. Springer-Verlag, 1995.

Dawar, A. Lindell, S. and Weinstein, S. Infinitary logic and inductive definability over finite structures. Information and Computation, 119(2):160–175, 1995.Google Scholar

Dawar, A. Lindell, S. and Weinstein, S. First order logic, fixed point logic and linear order. In Kleine-Büning, H. editor, Computer Science Logic –95, volume 1092 of LNCS, pages 161–177. Springer-Verlag, 1996.

Fagin., R. Generalized first-order spectra and polynomial-time recognizable sets. In Karp, R. M. editor, Complexity of Computation, SIAM-AMS Proceedings, Vol 7, pages 43–73, 1974.Google Scholar

Graham, R. L. Rothschild, B. L. and Spencer, J. H. Ramsey Theory. Wiley, 1980.

Gurevich., Y. Toward logic tailored for computational complexity. In Richter, M. et al., editors, Computation and Proof Theory, pages 175-216. Springer Lecture Notes in Mathematics, 1984.Google Scholar

Immerman., N. Upper and lower bounds for first-order expressibility. Journal of Computer and System Sciences, 25:76–98, 1982.Google Scholar

Immerman., N. Relational queries computable in polynomial time. Information and Control, 68:86–104, 1986.Google Scholar

Kolaitis, Ph. G. and Vardi, M. Y. Infinitary logics and 0-1 laws. Information and Computation, 98(2):258–294, 1992.Google Scholar

Luczak, T. 1995. Personal Communication.

Otto., M. Ptime canonization for two variables with counting. In Proc. 10th IEEE Symp. on Logic in Computer Science, pages 342–352, 1995.Google Scholar

Poizat., B. Deux ou trois choses que je sais de Ln . Journal of Symbolic Logic, 47(3):641–658, 1982.Google Scholar

Rosen, E. Shelah, S. and Weinstein, S. k-Universal finite graphs. In Boppana, R. and Lynch, J. F. editors, Logic and Random Structures, DIMACS Series in Deiscrete Mathematics and Theoretical Computer Science. American Mathematical Society, 1996. to appear.

Vardi, M. Y. The complexity of relational query languages. In Proceedings of the 14th ACM Symposium on the Theory of Computing, pages 137–146, 1982.Google Scholar