Abstract
In finite model theory, we deal with logics over finite structures. In embedded finite model theory, we deal with logics over finite structures embedded into infinite ones.
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.
Bibliographic Notes
P. Kanellakis, G. Kuper, and P. Revesz. Constraint query languages. Journal of Computer and System Sciences, 51 (1995), 26 52.
G. Kuper, L. Libkin, and J. Paredaens, eds. Constraint Databases. Springer-Verlag, 2000.
L. Libkin. Embedded finite models and constraint databases. In [99].
J. Van den Bussche. Constraint databases: a tutorial introduction. SIGMOD Record, 29 (2000), 44–51.
S. Grumbach and J. Su. Queries with arithmetical constraints. Theoretical Computer Science, 173 (1997), 151–181.
J. Paredaens, J. Van den Bussche, and D. Van Gucht. First-order queries on finite structures over the reals. SIAM Journal on Computing, 27 (1998), 1747–1763.
M. Benedikt and L. Libkin. Relational queries over interpreted structures. Journal of the ACM, 47 (2000), 644–680.
L. van den Dries. Tame Topology and O-Minimal Structures. Cambridge University Press, 1998.
M. Otto and J. Van den Bussche. First-order queries on databases embedded in an infinite structure. Information Processing Letters, 60 (1996), 37–41.
R.L. Graham, B.L. Rothschild and J.H. Spencer. Ramsey Theory. John Wiley & Sons, 1990.
S. Grumbach and J. Su. Queries with arithmetical constraints. Theoretical Computer Science, 173 (1997), 151–181.
B. Kuijpers, J. Paredaens, and J. Van den Bussche. Topological elementary equivalence of closed semi-algebraic sets in the real plane. Journal of Symbolic Logic, 65 (2000), 1530–1555.
O. Chapuis and P. Koiran. Definability of geometric properties in algebraically closed fields. Mathematical Logic Quarterly, 45 (1999), 533–550.
H. Fournier. Quantifier rank for parity of embedded finite models. Theoretical Computer Science, 295 (2003), 153–169.
A. Tarski. A Decision Method for Elementary Algebra and Geometry. Univ. of California Press, 1951. Reprinted in Quantifier Elimination and Cylindrical Algebraic Decomposition, B. Caviness and J. Johnson, eds. Springer-Verlag, 1998, pages 24–84.
J. Robinson. Definability and decision problems in arithmetic. Journal of Symbolic Logic, 14 (1949), 98–114.
D.A.M. Barrington, N. Immerman, C. Lautemann, N. Schweikardt, and D. Thérien. The Crane Beach conjecture. In IEEE Symp. on Logic in Computer Science, 2001,pages 187–196.
M. Benedikt, L. Libkin, T. Schwentick, and L. Segoufin. Definable relations and first-order query languages over strings. Journal of the ACM, 50 (2003), 694–751.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Libkin, L. (2004). Embedded Finite Models. In: Elements of Finite Model Theory. Texts in Theoretical Computer Science. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-07003-1_13
Download citation
DOI: https://doi.org/10.1007/978-3-662-07003-1_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05948-3
Online ISBN: 978-3-662-07003-1
eBook Packages: Springer Book Archive