Abstract
The subject of this paper is the part of finite model theory intimately related to the classical model theory. In the very beginning of our career in computer science, we attended a few lectures on database theory where databases were inconspicuously allowed to be infinite and then classical model-theoretical theorems were applied. The use of infinite databases aroused our suspicion and prompted us to investigate the status of some most famous model-theoretical theorems in the case of finite structures [Gu84]. The theorems miserably fail. One theorem (a theorem of Roger Lyndon: Every sentence monotone in a predicate P is logically equivalent to a sentence positive in P [Ly59]) resisted the attack and was refuted by Miklos Ajtai and ourselves later [AG87]. In Section 1, we give some old and new counter-examples to classical mo del-theoretic theorems in the finite case.
Partially supported by NSF grants DCR 85-03275 and CCR 89-04728.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Ajtai and Y. Gurevich, “Monotone versus positive”, Journal of ACM, 34, 1987, 1004–1015.
Ajtai, M. and Y. Gurevich, “Datalog vs. first-order logic”, 30th Annual Symposium on Foundations of Computer Science, IEEE Computer Society, 1989, 142–147.
A. Ehrenfeucht, “An application of games to the completeness problem for formalized theories”, Fund. Math. 49 (1961), 129–141.
Y. Gurevich, “Toward logic tailored for computational complexity”, In “Computation and Proof Theory” (Ed. M. Richter et al.), Springer Lecture Notes in Math. 1104 (1984), 175–216.
Y. Gurevich, “Logic and the challenge of computer science”, In “Current Trends in Theoretical Computer Science” (ed. E. Borger ), Computer Science Press, 1988, 1–57.
Y. Gurevich and S. Shelah, “A Preservation Theorem in Finite Model Theory”, in preparation.
R. C. Lyndon, “An interpolation theorem in the predicate calculus”, Pacific J. Math. 9 (1959), 155–164.
B. A. Trakhtenbrot, “The impossibility of an algorithm for the decision problem on finite classes”, Doklady Akademii Nauk SSSR (Proceedings of the Academy of Sciences of USSR) 70 (1950), 569–572.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Birkhäuser Boston
About this chapter
Cite this chapter
Gurevich, Y. (1990). On Finite Model Theory (Extended Abstract). In: Buss, S.R., Scott, P.J. (eds) Feasible Mathematics. Progress in Computer Science and Applied Logic, vol 9. Birkhäuser Boston. https://doi.org/10.1007/978-1-4612-3466-1_12
Download citation
DOI: https://doi.org/10.1007/978-1-4612-3466-1_12
Publisher Name: Birkhäuser Boston
Print ISBN: 978-0-8176-3483-4
Online ISBN: 978-1-4612-3466-1
eBook Packages: Springer Book Archive