Abstract
We know how to prove basic results about FO; so now we start adding things to FO. One way to make FO more expressive is to include additional operations on the universe. For example, in database applications, data items stored in a database are numbers, strings, etc. Both numbers and strings could be ordered; on numbers we have arithmetic operations, on strings we have concatenation, substring tests, and so on. As query languages routinely use those operations, one may want to study them in the context of FO.
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
S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases, Addison-Wesley, 1995.
M. Grohe and T. Schwentick. Locality of order-invariant first-order formulas. ACM Transactions on Computational Logic, 1 (2000), 112–130.
L. Libkin and L. Wong. Lower bounds for invariant queries in logics with counting. Theoretical Computer Science, 288 (2002), 153–180.
H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer-Verlag, 1995.
M. Otto. Epsilon-logic is more expressive than first-order logic over finite structures. Journal of Symbolic Logic, 65 (2000), 1749–1757.
B. Rossman. Successor-invariance in the finite. In IEEE Symp. on Logic in Computer Science, 2003, pages 148–157.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Libkin, L. (2004). Ordered Structures. In: Elements of Finite Model Theory. Texts in Theoretical Computer Science. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-07003-1_5
Download citation
DOI: https://doi.org/10.1007/978-3-662-07003-1_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05948-3
Online ISBN: 978-3-662-07003-1
eBook Packages: Springer Book Archive