Bounded Variable Logics and Counting: A Study in Finite Models

O. Introduction.- 1. Definitions and Preliminaries.- 2. The Games and Their Analysis.- 3. The Invariants.- 4. Fixed-Point Logic with Counting.- 5. Related Lindstrom Extensions.- 6. Canonization Problems.- 7. Canonization for Two Variables.

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

[2]  Daniel Leivant,et al.  Logic and Computational Complexity , 1995, Lecture Notes in Computer Science.

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

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

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

[6]  A. Selman,et al.  Complexity theory retrospective II , 1998 .

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

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

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

[10]  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.

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

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

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

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

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

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

[17]  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.

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

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

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

[21]  A. Dawar.  FINITE MODEL THEORY (Perspectives in Mathematical Logic) , 1997 .

[22]  Neil Immerman,et al.  An optimal lower bound on the number of variables for graph identification , 1992, Comb..

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

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

[25]  Jon Barwise,et al.  Model-Theoretic Logics , 2016 .

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

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

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

[29]  Michael M. Richter,et al.  Computation and Proof Theory , 1984 .

[30]  Martin Otto,et al.  Undecidability Results on Two-Variable Logics , 1997, STACS.

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

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

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

[34]  C. C. Elgot.  Decision problems of finite automata design and related arithmetics , 1961 .

[35]  Phokion G. Kolaitis,et al.  Generalized Quantifiers and Pebble Games on Finite Structures , 1995, Ann. Pure Appl. Log..

[36]  Andreas Blass,et al.  Equivalence relations, invariants, and normal forms , 1983, Logic and Machines.

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