Definability with a predicate for a semi-linear set
Benedikt, Michael ; Keisler, H. Jerome
J. Symbolic Logic, Tome 68 (2003) no. 1, p. 319-351 / Harvested from Project Euclid
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.
Publié le : 2003-03-14
Classification: 
@article{1045861516,
     author = {Benedikt, Michael and Keisler, H. Jerome},
     title = {Definability with a predicate for a semi-linear set},
     journal = {J. Symbolic Logic},
     volume = {68},
     number = {1},
     year = {2003},
     pages = { 319-351},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1045861516}
}
Benedikt, Michael; Keisler, H. Jerome. Definability with a predicate for a semi-linear set. J. Symbolic Logic, Tome 68 (2003) no. 1, pp.  319-351. http://gdmltest.u-ga.fr/item/1045861516/