Abstract
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. No attempt is made to be comprehensive.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
M. Ajtai and R. Fagin. Reachability is harder for directed than for undirected finite graphs. Journal of Symbolic Logic, 55(1):113–150, March 1990.
M. Ajtai and Y. Gurevich. Monotone versus positive. Journal of the ACM, 34:1004–1015, 1987.
M. Ajtai and Y. Gurevich. Datalog vs. first-order logic. In Proc. 30th IEEE Symp. on Foundations of Computer Science, pages 142–146, 1989.
M. Ajtai. Σ 11 -formulae on finite structures. Annals of Pure and Applied Logic, 24:1–48, 1983.
G. Asser. Das Repräsentantenproblem im Prädikatenkalkül der ersten Stufe mit identität. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 1:252–263, 1955.
J. Barwise. Model-theoretic logics: background and aims. In J. Barwise and S. Feferman, editors, Model-Theoretic Logics, pages 3–23. Springer-Verlag, 1985.
J. H. Bennett. On spectra. PhD thesis, Princeton University, 1962.
A. Blass, Y. Gurevich, and D. Kozen. A zero-one law for logic with a fixed point operator. Information and Control, 67:70–90, 1985.
R. Book, C. Wilson, and X. Mei-Rui. Relativizing time, space, and time-space. SIAM Journal on Computing, 11:571–581, 1982.
J. Cai, M. Fürer, and N. Immerman. 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.
A. Chandra and D. Harel. Structure and complexity of relational queries. Journal of Computer and System Sciences, 25:99–128, 1982.
A. Chandra. Theory of database queries. In Proc. 7th ACM Symp. on Principles of Database Systems, pages 1–9, 1988.
K. J. Compton, C. W. Henson, and S. Shelah. Nonconvergence, undecidability, and intractibility in asymptotic problems. Annals of Pure and Applied Logic, 36:207–224, 1987.
A. Church. Introduction to mathematical logic, volume I. Princeton University Press, 1956.
C. C. Chang and H. J. Keisler. Model Theory. North-Holland, 1973.
A. Cobham. The intrinsic computational difficulty of functions. In Y. Bar-Hillel, editor, Proc. 1964 International Congress for Logic, Methodology, and Philosophy of Science, pages 24–30. North Holland, 1964.
K. J. Compton. A logical approach to asymptotic combinatorics I: First-order properties. Advances in Mathematics, 65:65–96, 1987.
K. Compton. 0–1 laws in logic and combinatorics. In I. Rival, editor, Proc. 1987 NATO Adv. Study Inst. on algorithms and order, pages 353–383. Reidel, 1988.
S. A. Cook. The complexity of theorem proving procedures. In Proc. 3rd ACM Symp. on Theory of Computing, pages 151–158, 1971.
S. A. Cook. A hierarchy for nondeterministic time complexity. In Proc. 4th ACM Symp. on Theory of Computing, pages 187–192, 1972.
M. I. Dekhtyar. On the relativization of deterministic and nondeterministic complexity classes. In Proc. 5th Conference on Mathematical Foundations of Computer Science, Springer-Verlag Lecture Notes in Computer Science 5, pages 255–259, 1976.
D. Dreben and W. D. Goldfarb. The Decision Problem: Solvable Classes of Quantificational Formulas. Addison-Wesley, 1979.
J. Edmonds. Paths, trees, and flowers. Canadian J. Math., 17:449–467, 1965.
A. Ehrenfeucht. An application of games to the completeness problem for formalized theories. Fund. Math., 49:129–141, 1961.
H. B. Enderton. A Mathematical Introduction to Logic. Academic Press, 1972.
P. Erdös and J. Spencer. Probabilistic methods in combinatorial mathematics. Akadamia Kiado, 1974.
R. Fagin. Probabilities on finite models. Notices of the American Mathematical Society, page A714, October 1972. Abstract number 72T-E90.
R. Fagin. Contributions to the model theory of finite structures. PhD thesis, University of California at Berkeley, 1973.
R. Fagin. Generalized first-order spectra and polynomial-time recognizable sets. In R. M. Karp, editor, Complexity of Computation, SIAM-AMS Proceedings, Vol. 7, pages 43–73, 1974.
R. Fagin. Monadic generalized spectra. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 21:89–96, 1975.
R. Fagin. A spectrum hierarchy. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 21:123–134, 1975.
R. Fagin. A two-cardinal characterization of double spectra. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 21:121–122, 1975.
R. Fagin. Probabilities on finite models. Journal of Symbolic Logic, 41(1):50–58, March 1976.
R. Fagin. Horn clauses and database dependencies. Journal of the ACM, 29(4):952–985, October 1982.
R. Fraïssé. Sur les classifications des systems de relations. Publications Sc. d l'Université d'Alger, 1(I), 1954.
R. Fraïssé. Cours de Logique Mathematique. Gauthier-Villars and E. Nauwelaerts, 1967. English translation is Course in Mathematical Logic, Reidel Holland, 1973, translated by D. Louvish.
M. Furst, J. B. Saxe, and M. Sipser. Parity, circuits, and the polynomial time hierarchy. In Proc. 22nd IEEE Symp. on Foundations of Computer Science, pages 260–270, 1981.
R. Fagin and M. Y. Vardi. The theory of data dependencies: a survey. In Mathematics of Information Processing, Proceedings of Symposia in Applied Mathematics, volume 34, pages 19–72. American Mathematical Society, 1986.
H. Gaifman. Concerning measures in first-order calculi. Israel Journal of Mathematics, 2:1–18, 1964.
M. Garey and D. S. Johnson. Computers and intractibility: a guide to the theory of NP-completeness. Freeman, 1979.
M. Garey, D. S. Johnson, and L. J. Stockmeyer. Some simplified NP-complete graph problems. Theoretical Computer Science, 1:237–267, 1976.
Y. V. Glebskis, D. I. Kogan, M. I. Liogon'kis, and V. A. Talanov. Range and degree of realizability of formulas in the restricted predicate calculus. Kibernetika, 2:17–28, 1969.
H. Gaifman, H. Mairson, Y. Sagiv, and M. Y. Vardi. Undecidable optimization problems for database logic programs. In Proc. 2nd IEEE Symp. on Logic in Computer Science, pages 106–115, 1987.
W. D. Goldfarb. The Gödel class with equality is unsolvable. Bull. Amer. Math. Soc. (New Series), 10:113–115, 1984.
E. Grandjean. Complexity of the first-order theory of almost all structures. Information and Control, 52:180–204, 1983.
Y. Gurevich and S. Shelah. Fixed-point extensions of first-order logic. Annals of Pure and Applied Logic, 32:265–280, 1986.
Y. Gurevich and S. Shelah. A preservation theorem in finite model theory. To appear, 1990.
Y. Gurevich. The decision problem for standard classes. Journal of Symbolic Logic, 41:460–464, 1976.
Y. Gurevich. Toward logic tailored for computational complexity. In M. Richter et al., editor, Computation and Proof Theory, pages 175–216. Springer Lecture Notes in Math. 1104, 1984.
Y. Gurevich. Logic and the challenge of computer science. In E. Börger, editor, Current trends in theoretical computer science, pages 1–57. Computer Science Press, 1988.
Y. Gurevich. On finite model theory. In S. R. Buss and P. J. Scott, editors, Perspectives in Computer Science. Birkhauser, 1990. Proceedings of Feasible Mathematics Workshop, Cornell University, June 1989.
H. Gaifman and M. Y. Vardi. A simple proof that connectivity is not first-order. Bulletin of the European Association for Theoretical Computer Science, 26:43–45, June 1985.
J. Hartmanis, N. Immerman, and J. Sewelson. Sparse sets in NP-P — EXPTIME vs. NEXPTIME. Information and Control, 65:159–181, 1985.
N. Immerman. Number of quantifiers is better than number of tape cells. Journal of Computer and System Sciences, 22:384–406, 1981.
N. Immerman. Upper and lower bounds for first-order expressibility. Journal of Computer and System Sciences, 25:76–98, 1982.
N. Immerman. Relational queries computable in polynomial time. Information and Control, 68:76–98, 1986.
N. Immerman. Languages that capture complexity classes. SIAM Journal on Computing, 16(4):760–778, 1987.
N. Immerman. Nondeterministic space is closed under complement. SIAM Journal on Computing, pages 935–938, 1988.
N. Immerman. Descriptive and computational complexity. In J. Hartmanis, editor, Computational Complexity Theory, Proc. Symp. in Applied Math. 38, pages 75–91. American Mathematical Society, 1989.
N. D. Jones and A. L. Selman. Turing machines and the spectra of first-order formulas with equality. Journal of Symbolic Logic, pages 139–150, 1974.
P. C. Kanellakis. Elements of relational database theory. In A. R. Meyer, M. Nivat, M. S. Paterson, D. Perrin, and J. van Leeuwen, editors, The handbook of theoretical computer science. North Holland, 1990. Also available as Brown University Technical Report CS-89-39, 1989.
R. M. Karp. Reducibility among combinatorial problems. In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations, pages 85–103. Plenum Press, 1975.
M. Kaufmann. Counterexample to the 0–1 law for existential monadic second-order logic. CLI Internal Note 32, Computational Logic Inc., December 1987.
Ph. G. Kolaitis. Implicit definability on finite structures and unambiguous computations. In Proc. 5th IEEE Symp. on Logic in Computer Science, pages 168–180, 1990.
M. Kaufmann and S. Shelah. On random models of finite power and monadic logic. Discrete Mathematics, 54:285–293, 1985.
Ph. G. Kolaitis and M. Y. Vardi. The decision problem for the probabilities of higher-order properties. In Proc. 19th ACM Symp. on Theory of Computing, pages 425–435, 1987.
Ph. G. Kolaitis and M. Y. Vardi. 0–1 laws and decision problems for fragments of second-order logic. Information and Computation, 87:302–338, 1990.
Ph. G. Kolaitis and M. Y. Vardi. 0–1 laws for fragments of second-order logic. Research Report RJ 7508, IBM, 1990.
Ph. G. Kolaitis and M. Y. Vardi. 0–1 laws for infinitary logics. In Proc. 5th IEEE Symp. on Logic in Computer Science, pages 156–167, 1990.
L. A. Levin. Universal sorting problems. Problemy Peredaci Informacii, 9:115–116, 1973. In Russian. English translation in Problems of Information Transmission 9:265–266.
H. R. Lewis. Unsolvable Classes of Quantificational Formulas. Addison-Wesley, 1979.
A. B. Livchak. The relational model for systems of automatic testing. Automatic documentation and mathematical linguistics, 4:17–19, 1982.
J. Lynch. Almost sure theories. Annals of Mathematical Logic, 18:91–135, 1980.
J. Lynch. Probabilities of first-order sentences about unary functions. Trans. American Mathematical Society, 287:543–568, 1985.
D. Maier. The theory of relational databases. Computer Science Press, 1983.
J. A. Makowsky. Compactness, embeddings and definability. In J. Barwise and S. Feferman, editors, Model-Theoretic Logics, pages 645–716. Springer-Verlag, 1985.
L. Pacholski and W. Szwast. The 0–1 law fails for the class of existential second-order Gödel sentences with equality. In Proc. 30th IEEE Symp. on Foundations of Computer Science, pages 160–163, 1989.
R. Rado. Universal graphs and universal functions. Acta Arith., 9:331–340, 1964.
W. J. Savitch. Relationships between nondeterministic and deterministic tape complexities. Journal of Computer and System Sciences, 4:177–192, 1970.
H. Scholz. Problem #1. Journal of Symbolic Logic, 17:160, 1952.
S. Shelah. Classification theory and the number of non-isomorphic models. North Holland, 1978.
J. R. Shoenfield. Mathematical Logic. Addison-Wesley, 1967.
S. Shelah and J. Spencer. Zero-one laws for sparse random graphs. Journal of the American Mathematical Society, 1:97–115, 1988.
R. Szelepcsényi. The method of forced enumeration for nondeterministic automata. Acta Informatica, 26:279–284, 1988.
W. W. Tait. A counterexample to a conjecture of Scott and Suppes. Journal of Symbolic Logic, 24:15–16, 1959.
A. Tarski. Contributions to the theory of models I,II. Indagationes Mathematicae, 16:572–588, 1954.
V. A. Talanov and V. V. Knyazev. The asymptotic truth value of infinite formulas. In Proc. All-Union seminar on discrete mathematics and its applications, pages 56–61, 1984. See Math. Rev. 89g:03054.
B. A. Trakhtenbrot. Impossibility of an algorithm for the decision problem in finite classes. Doklady Akademii Nauk SSSR, 70:569–572, 1950.
J. D. Ullman. Database and Knowledge-Base Systems, Volumes I and II. Computer Science Press, 1989.
M. Y. Vardi. The complexity of relational query languages. In Proc. 14th ACM Symp. on Theory of Computing, pages 137–146, 1982.
M. Y. Vardi. On decomposition of relational databases. In Proc. 23rd IEEE Symp. on Foundations of Computer Science, pages 176–185, 1982.
R. L. Vaught. Applications of the Lowenheim-Skolem-Tarski theorem to problems of completeness and decidability. Indagationes Mathematicae, 16:467–472, 1954.
R. L. Vaught. Sentences true in all constructive models. Journal of Symbolic Logic, 25(1):39–53, March 1960.
C. Wilson. Relativization, reducibilities, and the exponential hierarchy. Master's thesis, Toronto, 1980.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fagin, R. (1990). Finite-model theory—a personal perspective. In: Abiteboul, S., Kanellakis, P.C. (eds) ICDT '90. ICDT 1990. Lecture Notes in Computer Science, vol 470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53507-1_67
Download citation
DOI: https://doi.org/10.1007/3-540-53507-1_67
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53507-2
Online ISBN: 978-3-540-46682-6
eBook Packages: Springer Book Archive