Abstract
We consider order-generic queries, i.e., queries which commute with every order-preserving automorphism of a structure’s universe. It is well-known that first-order logic has the natural order-generic collapse over the rational and the real ordered group for the class of dense order constraint databases (also known as finitely representable databases). I.e., on this class of databases over 〈ℚ,〉 or 〈ℝ, 〉, addition does not add to the expressive power of first-order logic for defining order-generic queries. In the present paper we develop a natural generalization of the notion of finitely representable databases, where an arbitrary (i.e. possibly infinite) number of regions is allowed. We call these databases ω-representable, and we prove the natural order-generic collapse over the rational and the real ordered group for this larger class of databases.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
O.V. Belegradek, A.P. Stolboushkin, and M.A. Taitslin. Extended order-generic queries. Annals of Pure and Applied Logic, 97:85–125, 1999.
M. Benedikt, G. Dong, L. Libkin, and L. Wong. Relational expressive power of constraint query languages. Journal of the ACM, 45:1–34, 1998.
M. Benedikt and L. Libkin. Expressive power: The finite case. In G. Kuper, L. Libkin, and J. Paredaens, editors, Constraint Databases, pages 55–87. Springer, 2000.
H.D. Ebbinghaus and J. Flum. Finite Model Theory. Springer, 1999.
E. Grädel and S. Kreutzer. Descriptive complexity theory for constraint databases. In Proc. CSL 1999, volume 1683 of Lecture Notes in Computer Science, pages 67–81. Springer, 1999.
D. Harel. Towards a theory of recursive structures. In Proc. MFCS 1998, volume 1450 of Lecture Notes in Computer Science, pages 36–53. Springer, 1998.
B. Kuijpers and J. Van den Bussche. On capturing first-order topological properties of planar spatial databases. In Proc. ICDT 1999, volume 1540 of Lecture Notes in Computer Science, pages 187–198. Springer, 1999.
C. Lautemann and N. Schweikardt. An Ehrenfeucht-Faïssé approach to collapse results for first-order queries over embedded databases. In Proc. STACS 2001, volume 2010 of Lecture Notes in Computer Science, pages 455–466. Springer, 2001.
L. Segoufin and V. Vianu. Querying spatial databases via topological invariants. JCSS, 61(2):270–301, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schweikardt, N. (2001). The Natural Order-Generic Collapse for ω-Representable Databases over the Rational and the Real Ordered Group. In: Fribourg, L. (eds) Computer Science Logic. CSL 2001. Lecture Notes in Computer Science, vol 2142. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44802-0_10
Download citation
DOI: https://doi.org/10.1007/3-540-44802-0_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42554-0
Online ISBN: 978-3-540-44802-0
eBook Packages: Springer Book Archive