Hostname: page-component-6bf8c574d5-r4mrb Total loading time: 0 Render date: 2025-03-03T21:59:35.960Z Has data issue: false hasContentIssue false
  • English
  • Français

Definability with a predicate for a semi-linear set

Published online by Cambridge University Press:  12 March 2014

Michael Benedikt  and
H. Jerome Keisler
Michael Benedikt
Affiliation:
Bell Laboratories, 2701 Lucent Lane, Lisle, IL 60532, USA, E-mail: [email protected]
H. Jerome Keisler
Affiliation:
University of Wisconsin-Madison, Department of Mathematics Van Vleck Hall, 480 Lincoln Drive, Madison, Wisconsin 53706-1388, USA, E-mail: [email protected], URL: http://www.math.wisc.edu/~keisler
Get access Rights & Permissions [Opens in a new window]

Abstract

We settle a number of questions concerning definability in first order logic with an extra predicate symbol ranging over semi-linear sets. We give new results both on the positive and negative side: we show that in first-order logic one cannot query a semi-linear set as to whether or not it contains a line, or whether or not it contains the line segment between two given points. However, we show that some of these queries become definable if one makes small restrictions on the semi-linear sets considered.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 68 , Issue 1 , March 2003 , pp. 319 - 351
Copyright
Copyright © Association for Symbolic Logic 2003

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Afrati, F., Andronikos, T., and Kavalieros, T., On the expressiveness of first-order constraint languages, Constraint databases and applications, ESPRIT CONTESSA workshop (Kuper, G. M. and Wallace, M., editors), Lecture Notes in Computer Science, vol. 1034, Springer, 1996, pp. 22–39.CrossRefGoogle Scholar
[2]Afrati, F., Andronikos, T., and Kavalieros, T., On the expressiveness of query languages with linear constraints: Capturing desirable spatial properties, Constraint databases and their applications, Second international workshop on constraint database systems, CDB '97 (Gaede, V.et. al., editor), Lecture Notes in Computer Science, vol. 1191, Springer, 1997, pp. 105–115.Google Scholar
[3]Afrati, F., Cosmadakis, S., Grumbach, S., and Kuper, G., Linear vs. polynomial constraints in database query languages, Proceedings of the second international workshop on principles and practice of constraint programming, Lecture Notes in Computer Science, vol. 874, Springer, 1995, pp. 181–192.CrossRefGoogle Scholar
[4]Benedikt, M., Dong, G., Libkin, L., and Wong, L., Relational expressive power of constraint query languages, Journal of the ACM, vol. 45 (1998), pp. 1–34.CrossRefGoogle Scholar
[5]Benedikt, M. and Keisler, H. J., Expressive power of unary counters, Structures in Logic and Computer Science (Mycielski, , Rozenberg, , and Salomaa, , editors), Lecture Notes in Computer Science, vol. 1261, Springer, 1997.CrossRefGoogle Scholar
[6]Benedikt, M. and Keisler, H. J., Definability over linear constraints, Computer science logic, CSL 2000 (Clote, P. and Schwichtenberg, H., editors), Lecture Notes in Computer Science, vol. 1862, Springer, 2000, pp. 217–231.Google Scholar
[7]Chang, C.C. and Keisler, H.J., Model Theory, North Holland, 1990.Google Scholar
[8]Chapuis, O. and Koiran, P., Definability of geometric properties in algebraically closed fields, Mathematical Logic Quarterly, vol. 45 (1999), no. 4, pp. 533–550.CrossRefGoogle Scholar
[9]Kanellakis, P., Kuper, G., and Revesz, P., Constraint query languages, Journal of Computer and System Sciences, vol. 51 (1995), pp. 26–52.CrossRefGoogle Scholar
[10]Karp, C., Finite quantifier equivalence, The Theory of Models, North-Holland, 1965, pp. 407–412.Google Scholar
[11]Kuijpers, B., Paredaens, J., and Van den Bussche, J., On topological elementary equivalence of spatial databases, Proceedings of the Sixth International Conference on Database Theory, Lecture Notes in Computer Science, vol. 1186, Springer, 1997, pp. 432–446.Google Scholar
[12]Kuper, G., Libkin, L., and Paredaens, J. (editors), Constraint databases, Springer-Verlag, 2000.CrossRefGoogle Scholar