Bounded Variable Logics and Counting

[1]  Erich Grädel,et al.  Two-variable logic with counting is decidable , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[2]  Martin Otto.  Canonization for Two Variables and Puzzles on the Square , 1997, Ann. Pure Appl. Log..

[3]  Erich Grädel,et al.  Undecidability results on two-variable logics , 1997, Arch. Math. Log..

[4]  Martin Otto,et al.  The expressive power of fixed-point logic with counting , 1996, Journal of Symbolic Logic.

[5]  Saharon Shelah,et al.  On finite rigid structures , 1994, Journal of Symbolic Logic.

[6]  Yuri Gurevich,et al.  Tailoring Recursion for Complexity , 1995, J. Symb. Log..

[7]  Martin Otto,et al.  Ptime canonization for two variables with counting , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[8]  A. Dawar,et al.  Infinitary Logic and Inductive Definability over Finite Structures , 1995, Inf. Comput..

[9]  Martin Grohe,et al.  Complete problems for fixed-point logics , 1995, Journal of Symbolic Logic.

[10]  Anuj Dawar.  Generalized Quantifiers and Logical Reducibilities , 1995, J. Log. Comput..

[11]  Jörg Flum,et al.  Finite model theory , 1995, Perspectives in Mathematical Logic.

[12]  Anuj Dawar,et al.  A Restricted Second Order Logic for Finite Structures , 1994, LCC.

[13]  Yuri Gurevich,et al.  Metafinite Model Theory , 1994, Inf. Comput..

[14]  Lauri Hella,et al.  The expressive power of finitely many generalized quantifiers , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[15]  Martin Otto,et al.  Generalized quantifiers for simple properties , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[16]  Yuri Gurevich,et al.  The Classical Decision Problem , 1997, Perspectives in Mathematical Logic.

[17]  Ronald Fagin,et al.  Finite-Model Theory - A Personal Perspective , 1990, Theor. Comput. Sci..

[18]  A. Dawar.  Feasible computation through model theory , 1993 .

[19]  Martin Otto,et al.  Inductive Definability with Counting on Finite Structures , 1992, CSL.

[20]  Phokion G. Kolaitis,et al.  Generalized quantifiers and pebble games on finite structures , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[21]  Phokion G. Kolaitis,et al.  Fixpoint logic vs. infinitary logic in finite-model theory , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[22]  Phokion G. Kolaitis,et al.  Infinitary Logics and 0-1 Laws , 1992, Inf. Comput..

[23]  Serge Abiteboul,et al.  Generic Computation and its complexity , 1991, STOC '91.

[24]  Daniel Leviant.  Inductive definitions over finite structures , 1990 .

[25]  E. Lander,et al.  Describing Graphs: A First-Order Approach to Graph Canonization , 1990 .

[26]  Neil Immerman,et al.  An optimal lower bound on the number of variables for graph identification , 1989, 30th Annual Symposium on Foundations of Computer Science.

[27]  Neil Immerman,et al.  Descriptive and Computational Complexity , 1989, FCT.

[28]  S. Abiteboul,et al.  Fixpoint extensions of first-order logic and datalog-like languages , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[29]  Neil Immerman,et al.  Languages that Capture Complexity Classes , 1987, SIAM J. Comput..

[30]  Elias Dahlhaus,et al.  Skolem Normal Forms Concerning the Least Fixpoint , 1987, Computation Theory and Logic.

[31]  Neil Immerman,et al.  Expressibility as a complexity measure: results and directions , 1987, SCT.

[32]  Ingo Wegener,et al.  The complexity of Boolean functions , 1987 .

[33]  Neil Immerman,et al.  Relational Queries Computable in Polynomial Time , 1986, Inf. Control..

[34]  Saharon Shelah,et al.  Fixed-point extensions of first-order logic , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[35]  Jörg Flum,et al.  Mathematical logic , 1985, Undergraduate texts in mathematics.

[36]  Yuri Gurevich,et al.  Toward logic tailored for computational complexity , 1984 .

[37]  Andreas Blass,et al.  Equivalence Relations, Invariants, and Normal Forms , 1983, SIAM J. Comput..

[38]  Bruno Poizat.  Deux Ou Trois Choses Que je Sais de Ln , 1982, J. Symb. Log..

[39]  Moshe Y. Vardi.  The complexity of relational query languages (Extended Abstract) , 1982, STOC '82.

[40]  Neil Immerman,et al.  Number of Quantifiers is Better Than Number of Tape Cells , 1981, J. Comput. Syst. Sci..

[41]  Neil Immerman,et al.  Upper and lower bounds for first order expressibility , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[42]  David Harel,et al.  Structure and complexity of relational queries , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[43]  David Harel,et al.  Computable Queries for Relational Data Bases , 1980, J. Comput. Syst. Sci..

[44]  Paul Erdös,et al.  Random Graph Isomorphism , 1980, SIAM J. Comput..

[45]  K. Jon Barwise,et al.  On Moschovakis closure ordinals , 1977, Journal of Symbolic Logic.

[46]  Michael Mortimer,et al.  On languages with two variables , 1975, Math. Log. Q..

[47]  Nicholas Rescher,et al.  Quasi-truth-functional systems of propositional logic , 1962, Journal of Symbolic Logic.

[48]  C. C. Elgot.  Decision problems of finite automata design and related arithmetics , 1962 .

[49]  J. Büchi.  Weak Second‐Order Arithmetic and Finite Automata , 1960 .