Abstract

Finite-model theory is a study of the logical properties of finite mathematical structures. This paper is a very personalized view of finite-model theory, where the author focuses on his own personal history, and results and problems of interest to him, especially those springing from work in his Ph.D. thesis. Among the topics discussed are:

Citations

8879	Computers and Intractability: A guide to the Theory of NP-Completeness - Garey, Johnson - 1979
1117	Reducibility among combinatorial problems - Karp
539	A Mathematical Introduction to Logic - Enderton - 1972
485	The Complexity of Relational Query Languages - Vardi - 1982
409	The complexity of theorem proving procedures - Cook - 1971
396	Model Theory - Chang - 1973
384	Theory of Relational Databases - Maier - 1983
317	Some simplified NP-complete graph problems, Theoret - Garey, Johnson, et al. - 1976
262	Relationships between nondeterministic and deterministic tape complexities - Savitch - 1970
254	Relational queries computable in polynomial time - Immerman - 1986
242	Generalized first-order spectra and polynomial-time recognizable sets - Fagin - 1974
233	Structure and complexity of relational queries - Chandra, Harel - 1982
217	Nondeterministic space is closed under complement - Immerman - 1988
212	Languages that capture complexity classes - Immerman
195	Mathematical Logic - Shoenfield - 1967
192	Universality of data retrieval languages - Aho, Ullman - 1979
160	Classification theory and the number of non-isomorphic models - Shelah - 1978
149	Logic and the challenge of computer science - Gurevich - 1988
146	Applications of games to the completeness problem for formalized theories - Ehrenfeucht - 1961
129	The intrinsic computational difficulty of functions - Cobham - 1964
119	An Optimal Lower Bound on the Number of Variables for Graph Identi cation - Cai, Furer, et al. - 1989
115	circuits, and the polynomial time hierarchy - FURST, SAXE, et al.
112	Probabilities on finite models - Fagin - 1976
103	Elements of relational database theory - Kanellakis - 1990
103	The method of forced enumeration for nondeterministic automata - Szelepcsényi - 1988
88	Sigma 1 formulae on finite structures - Ajtai
79	On monadic NP vs. monadic co-NP - Fagin, Stockmeyer, et al. - 1995
78	S.: Fixed-Point Extensions of First-Order Logic - Gurevich, Shelah - 1986
77	The relative complexity of checking and evaluating - Valiant - 1976
70	W.D.: The Decision Problem: Solvable Classes of Quantificational Formulas - Dreben, Goldfarb - 1979
69	Reachability is harder for directed than for undirected finite graphs - Ajtai, Fagin - 1990
69	Probabilistic methods in combinatorics - Erdos, Spencer - 1974
69	Sur quelques classifications des systemes de relations - Frai’sse - 1954
69	Undecidable optimization problems for database logic programs - Gaifman, Mairson, et al. - 1993
69	Toward logic tailored for computational complexity - Gurevich - 1984
61	Metafinite model theory - Gradel, Gurevich - 1998
57	Monadic generalized spectra, Zeitschrift fur Mathematische Logik und Grundlagen der Mathematik - Fagin - 1975
54	Theory of Database Queries - Chandra - 1988
53	Range and degree of realizability of formulas in the restricted predicate calculus - Glebskii, Kogan, et al. - 1969
49	Horn Clauses and Database Dependencies - Fagin - 1982
48	Sparse sets - Hartmanis, Immerman, et al. - 1985
48	Descriptive and computational complexity - Immerman - 1989
45	Upper and lower bounds for first-order expressibility - Immerman - 1982
44	0-1 laws in logic and combinatorics - Compton - 1989
43	Impossibility of an algorithm for the decision problem in finite classes - Trakhtenbrot - 1950
39	Universal graphs and universal functions - Rado - 1954
39	Zero-one laws for sparse random graphs - Shelah, Spencer - 1988
38	A hierarchy of nondeterministic time complexity - Cook - 1973
37	Number of quantifiers is better than number of tape cells - Immerman - 1981
34	Asymmetric graphs - Erdős, Rényi - 1963