Abiteboul, S. and Vianu, V.. Fixpoint extensions of first-order logic and Datalog-like languages. In Proc. 4th IEEE Symp. on Logic in Computer Science, pages 71–79, 1989.Google Scholar

Abiteboul, S. and Vianu, V.. Generic computation and its complexity. In Proc. 23rd ACM Symp. on Theory of Computing, pages 209–219, 1991.Google Scholar

Babai, L., Erdös, P., and Selkow, M.. Random graph isomorphism. SIAM Journal of Computing, 9:628–635, 1980.Google Scholar

Babai, L. and Kučera, L.. Canonical labellings of graphs in linear average time. In Proc. 21st IEEE Symp. on Foundations of Computer Science, pages 39–46, 1980.Google Scholar

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

Blass, A. and Gurevich, Y.. Equivalence relations, invariants, and normal forms, II. In Börger, E., Hasenjäger, G. and Rödding, D., editors, Logic and Machines: Decision Problems and Complexity, Lecture Notes in Computer Science 171, pages 24–42. Springer-Verlag, 1984.

Börger, E., Grädel, E., and Gurevich, Y.. The Classical Decision Problem, Perspectives in Mathematical Logic, Springer-Verlag, 1996.

Büchi, J. R.. Weak second-order arithmetic and finite automata. Z. Math. Logik Grundlagen Math., 6:66–92, 1960.Google Scholar

Cai, J., Fürer, M., and Immerman, N.. An optimal lower bound on the number of variables for graph identification. In Proc. 30th IEEE Symp. on Foundations of Computer Science, pages 612–617, 1989.Google Scholar

Cai, J., Fürer, M., and Immerman, N.. An optimal lower bound on the number of variables for graph identification. Combinatorica, 12:389–410, 1992.Google Scholar

Chandra, A. and Harel, D.. Computable queries for relational databases. Journal of Computer and System Sciences, 21:156–178, 1980.Google Scholar

Chandra, A. and Harel, D.. Structure and complexity of relational queries. Journal of Computer and System Sciences, 25:99–128, 1982.Google Scholar

Dahlhaus, E.. Skolem normal forms concerning the least fixpoint. In Börger, E., editor, Computation Theory and Logic, Lecture Notes in Computer Science 270, pages 101–106. Springer-Verlag, 1987.

Dawar, . Feasible computation through model theory. PhD thesis, University of Pennsylvania, 1993.

Dawar, A.. Generalized quantifiers and logical reducibilities. Journal of Logic and Computation, 5:213–226, 1995.Google Scholar

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

Dawar, A. and Hella, L.. The expressive power of finitely many generalized quantifiers. In Proc. 9th IEEE Symp. on Logic in Computer Science, pages 20–29, 1994.Google Scholar

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

Ebbinghaus, H.-D.. Extended logics: the general framework. In Barwise, J. and Feferman, S., editors, Model-Theoretic Logics, pages 25–76. Springer-Verlag, 1985.

Ebbinghaus, H.-D. and Flum, J.. Finite Model Theory. Perspectives in Mathematical Logic, Springer-Verlag, 1995.

Ebbinghaus, H.-D., Flum, J., and Thomas, W.. Mathematical Logic. Springer-Verlag, 2nd edition, 1994.

Elgot, C.. Decision problems of finite-automata design and related arithmetics. Trans. Amer. Math. Soc., 98:21–51, 1961.Google Scholar

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

Fagin, R.. Finite-model theory — a personal perspective. In Abiteboul, S. and Kanellakis, P., editors, Proc. 1990 International Conference on Database Theory, Lecture Notes in Computer Science 470, pages 3–24. Springer-Verlag, 1990. Also in Theoretical Computer Science, 116:3–31, 1993.

Grädel, E. and Gurevich, Y.. Tailoring recursion for complexity. Journal of Symbolic Logic, 60:952–969, 1995.Google Scholar

Grädel, E. and Gurevich, Y.. Metafinite model theory. In Leivant, D., editor, Logic and Computational Complexity, pages 313–366. Springer-Verlag, 1995.

Grädel, E., Kolaitis, Ph. G., and Vardi, M. Y.. On the decison problem for two-variable first-order logic. Submitted, 1996.

Grädel, E. and Otto, M.. Inductive definability with counting on finite structures. In Börger, E. et al., editors, Computer Science Logic, CSL –92, Selected Papers, Lecture Notes in Computer Science 702, pages 231— 247. Springer-Verlag, 1993.

Grädel, E., Otto, M., and Rosen, E.. Undecidability results on two-variable logics. Preprint, 1996.

Grädel, E., Otto, M., and Rosen, E.. Two-variable logic with counting is decidable. Preprint, 1996.

Grohe, M.. Complete problems for fixed-point logics. Journal of Symbolic Logic, 60:517–527, 1995.Google Scholar

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

Gurevich, Y.. Logic and the challenge of computer science. In Börger, , editor, Current Trends in Theoretical Computer Science, pages 1–57. Computer Science Press, 1988.

Gurevich, Y. and Shelah, S.. Fixed-point extensions of first-order logic. Annals of Pure and Applied Logic, 32:265–280, 1986.

Gurevich, Y. and Shelah, S.. On finite rigid structures. Journal of Symbolic Logic, 61:549–562, 1996.Google Scholar

Härtig, H.. Über einen Quantifikator mit zwei Wirkungsbereichen. In Kalmar, L., editor, Collogue sur les Fondements des Mathematiques, les Machines Mathematiques, et leur Applications, pages 31–36, 1965.

Immerman, N.. Number of quantifiers is better than number of tape cells. Journal of Computer and System Sciences, 22:384–406, 1981.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.

Immerman, N.. Expressibility as a complexity measure: results and directions. In Proc. 2nd Structure in Complexity Conference, pages 194—202, 1987.

Immerman, N.. Languages that capture complexity classes. SIAM Journal of Computing, 16:760–778, 1987.Google Scholar

Immerman, N.. Descriptive and computational complexity. In Hartmanis, J., editor, Computational Complexity Theory, Proc. Symp. Applied Math., Vol. 38, pages 75–91. American Mathematical Society, 1989.Google Scholar

Immerman, N. and Lander, E. S.. Describing graphs: a first-order approach to graph canonization. In Selman, A., editor, Complexity Theory Retrospective, pages 59–81. Springer-Verlag, 1990.

Kolaitis, Ph. G. and Väänänen, J.. Generalized quantifiers and pebble games on finite structures. Annals of Pure and Applied Logic, 74:23–75, 1995.Google Scholar

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

Kolaitis, Ph. G. and Vardi, M. Y.. Fixpoint logic vs. infinitary logic in finite-model theory. In Proc. 7th IEEE Symp. on Logic and Computer Science, pages 46–57, 1992.Google Scholar

Leivant, D.. Inductive definitions over finite structures. Information and Computation, 89:95–108, 1990.Google Scholar

Mortimer, M.. On languages with two variables. In Math, Z.. Logik und Grundlagen Math., 21:135–140, 1975.Google Scholar

Otto, M.. Generalized quantifiers for simple properties. In Proc. 9th IEEE Symp. on Logic and Computer Science, pages 30–39, 1994.

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

Otto, M.. Canonization for two variables and puzzles on the square. To appear in Annals of Pure and Applied Logic.

Otto, M.. The expressive power of fixed-point logic with counting. Journal of Symbolic Logic, 61:147–176, 1996.Google Scholar

Otto, M.. Bounded-variable logics: two, three, and more. Preprint, 1996.

Papadimitiou, C. H.. Computational Complexity. Addison-Wesley Publishing Company, 1995.Google Scholar

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

Rescher, N.. Plurality quantification. Journal of Symbolic Logic, 27:373–374, 1962.Google Scholar

Scott, D.. A decision method for validity of sentences in two variables. Journal of Symbolic Logic, 27:377, 1962.Google Scholar

Trakhtenbrot, B.. Finite automata and the logic of monadic predicates, (in Russian) Dokl. Akad. Nauk SSSR, 140:326–329, 1961.Google Scholar

Vardi, M. Y.. The complexity of relational query languages. 14th ACM Symp. on Theory of Computing, pages 137–146, 1982.

Wegener, I.. The Complexity of Boolean Functions. John Wiley and Teubner, 1987.Google Scholar