On the Expressive Power of Logics on Finite Models

[1]  Larry J. Stockmeyer,et al.  The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[2]  Phokion G. Kolaitis,et al.  On the expressive power of variable-confined logics , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[3]  H. Keisler.  Model theory for infinitary logic , 1971 .

[4]  Juris Hartmanis,et al.  Turing Award lecture on computational complexity and the nature of computer science , 1994, CACM.

[5]  Phokion G. Kolaitis,et al.  The decision problem for the probabilities of higher-order properties , 1987, STOC.

[6]  A. Tarski.  A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

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

[8]  Phokion G. Kolaitis,et al.  On the Complexity of Existential Pebble Games , 2003, CSL.

[9]  Yiannis N. Moschovakis,et al.  Elementary induction on abstract structures , 1974 .

[10]  H. James Hoover,et al.  Limits to Parallel Computation: P-Completeness Theory , 1995 .

[11]  David Harel,et al.  Horn Clauses Queries and Generalizations , 1985, J. Log. Program..

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13]  R. Labrecque.  The Correspondence Theory , 1978 .

[14]  Ronald Fagin,et al.  Reachability is harder for directed than for undirected finite graphs , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[15]  Serge Abiteboul,et al.  Datalog Extensions for Database Queries and Updates , 1991, J. Comput. Syst. Sci..

[16]  Neil Robertson,et al.  Graph Minors .XIII. The Disjoint Paths Problem , 1995, J. Comb. Theory B.

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

[18]  Michel de Rougemont.  Second-order and Inductive Definability on Finite Structures , 1987, Math. Log. Q..

[19]  Ronald Fagin,et al.  On monadic NP vs. monadic co-NP , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

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

[21]  Phokion G. Kolaitis,et al.  On the expressive power of datalog: tools and a case study , 1990, J. Comput. Syst. Sci..

[22]  Neil Immerman,et al.  Descriptive Complexity and Finite Models , 1997 .

[23]  Haim Gaifman,et al.  A simple proof that connectivity of finite graphs is not first-order definable , 1985, Bull. EATCS.

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

[25]  Robin Milner,et al.  Operational and Algebraic Semantics of Concurrent Processes , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[26]  Elena Pezzoli,et al.  Computational Complexity of Ehrenfeucht-Fraïssé Games on Finite Structures , 1998, CSL.

[27]  Ronald Fagin.  Generalized first-order spectra, and polynomial. time recognizable sets , 1974 .

[28]  Phokion G. Kolaitis.  Infinitary Logic in Finite Model Theory , 1997 .

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

[30]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

[31]  Thomas Schwentick,et al.  Graph connectivity and monadic NP , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

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

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

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

[35]  Martin Grohe.  Equivalence in Finite-Variable Logics is Complete for Polynomial Time , 1999, Comb..

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

[37]  Stephen A. Cook,et al.  An Observation on Time-Storage Trade Off , 1974, J. Comput. Syst. Sci..

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

[39]  Richard E. Ladner,et al.  On the Structure of Polynomial Time Reducibility , 1975, JACM.

[40]  Frank Harary,et al.  Graph Theory , 2016 .

[41]  P. Dedecker.  Review: Roland Fraisse, Sur Quelques Classifications des Systemes de Relations , 1957 .

[42]  Neil Robertson,et al.  Disjoint Paths—A Survey , 1985 .

[43]  Ronald Fagin,et al.  Probabilities on finite models , 1976, Journal of Symbolic Logic.

[44]  J. Spencer,et al.  Zero-one laws for sparse random graphs , 1988 .

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

[46]  Ronald Fagin,et al.  On Winning Strategies in Ehrenfeucht-Fraïssé Games , 1997, Theor. Comput. Sci..

[47]  Herbert B. Enderton,et al.  A mathematical introduction to logic , 1972 .

[48]  Yu. V. Glebskii,et al.  Range and degree of realizability of formulas in the restricted predicate calculus , 1969 .

[49]  Paul D. Seymour,et al.  Graph Minors: XV. Giant Steps , 1996, J. Comb. Theory, Ser. B.

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

[51]  Stephen A. Cook,et al.  An observation on time-storage trade off , 1973, J. Comput. Syst. Sci..

[52]  Yuri Gurevich,et al.  Monotone versus positive , 1987, JACM.

[53]  S. Kleene.  Arithmetical predicates and function quantifiers , 1955 .

[54]  Phokion G. Kolaitis,et al.  Conjunctive-query containment and constraint satisfaction , 1998, PODS.

[55]  H. Gaifman.  On Local and Non-Local Properties , 1982 .

[56]  Andreas Blass,et al.  A Zero-One Law for Logic with a Fixed-Point Operator , 1986, Inf. Control..

[57]  Ronald Fagin,et al.  Monadic generalized spectra , 1975, Math. Log. Q..

[58]  Ronald Fagin,et al.  Easier Ways to Win Logical Games , 1996, Descriptive Complexity and Finite Models.

[59]  John E. Hopcroft,et al.  The Directed Subgraph Homeomorphism Problem , 1978, Theor. Comput. Sci..

[60]  A. Ehrenfeucht.  An application of games to the completeness problem for formalized theories , 1961 .

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

[62]  RobertsonNeil,et al.  Graph minors. XIII , 1994 .