Abstract
Logic preservation theorems often have the form of a syntax/semantics correspondence. For example, the Los-Tarski theorem asserts that a first-order sentence is preserved by extensions if and only if it is equivalent to an existential sentence. Many of these correspondences break when one restricts attention to finite models. In such a case, one may attempt to find a new semantical characterization of the old syntactical property or a new syntactical characterization of the old semantical property. The goal of this paper is to provoke such a study.
Partially supported by NSF grant CCR 95-04375. During the work on this paper (1995-96 academic year), this coauthor was with CNRS in Paris, France
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. Ajtai and Y. Gurevich. Monotone versus positive. Journal of ACM, 34:1004–1015, 1987.
M. Ajtai and Y. Gurevich. DATALOG vs. first-order logic. In Proceedings 30th IEEE Symposium on Foundations of Computer Science, pages 142–146, 1989.
H. Andréka, J. van Benthem, and I. Németi. Submodel preservation theorems in finite variable fragments. In M. de Rijke A. Ponse and Y. Venema, editors, Modal Logic and Process Algebra. Cambridge University Press, 1994.
J. Barwise and J. van Benthem. Interpolation, preservation, and pebble games. Technical Report ML-96-12, ILLC, University of Amsterdam, 1996.
C. C. Chang and H. J. Keisler. Model theory. North Holland, 1973.
H.-D. Ebbinghaus and J. Flum. Finite model theory. Springer, 1995.
J. Flum. Private communication.
Y. Gurevich. Toward logic tailored for computational complexity. In M. M. Richter et al., editor, Computation and Proof Theory. Springer lecture Notes in Mathematics 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, editor, Feasible Mathematics, pages 211–219. Birkhauser, 1990.
H. Rogers. Theory of recursive functions and effective computability. MIT Press, 1992.
E. Rosen and S. Weinstein. Preservation theorems in finite model theory. In Logic and Computational Complexity, volume 960 of Lecture Notes in Computer Science, pages 480–502, 1995.
W. Tait. A counterexample to a conjecture of Scott and Suppes. Journal of Symbolic Logic, 24:15–16, 1959.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Alechina, N., Gurevich, Y. (1997). Syntax vs. semantics on finite structures. In: Mycielski, J., Rozenberg, G., Salomaa, A. (eds) Structures in Logic and Computer Science. Lecture Notes in Computer Science, vol 1261. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63246-8_2
Download citation
DOI: https://doi.org/10.1007/3-540-63246-8_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63246-7
Online ISBN: 978-3-540-69242-3
eBook Packages: Springer Book Archive