Geodesic
Sufficient conditions for effective translation of locally generic queries
Fundamentalʹnaâ i prikladnaâ matematika, Tome 15 (2009) no. 5, pp. 49-61.

Voir la notice de l'article provenant de la source Math-Net.Ru

This paper continues investigations in the database query first-order languages theory. It is known that for many decidable theories, the collapse result holds: each locally generic query is equivalent to some restricted query. But till now, the problem of effective construction of this query is almost unexplored. We use earlier results of the author on the construction of a method of effective obtaining this query. The method is rather general, it is applicable, for example, to the Presburger arithmetic and the real number theory. 
@article{FPM_2009_15_5_a3,
     author = {S. M. Dudakov},
     title = {Sufficient conditions for effective translation of locally generic queries},
     journal = {Fundamentalʹna\^a i prikladna\^a matematika},
     pages = {49--61},
     publisher = {mathdoc},
     volume = {15},
     number = {5},
     year = {2009},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/FPM_2009_15_5_a3/}
}
TY  - JOUR
AU  - S. M. Dudakov
TI  - Sufficient conditions for effective translation of locally generic queries
JO  - Fundamentalʹnaâ i prikladnaâ matematika
PY  - 2009
SP  - 49
EP  - 61
VL  - 15
IS  - 5
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/FPM_2009_15_5_a3/
LA  - ru
ID  - FPM_2009_15_5_a3
ER  - 
%0 Journal Article
%A S. M. Dudakov
%T Sufficient conditions for effective translation of locally generic queries
%J Fundamentalʹnaâ i prikladnaâ matematika
%D 2009
%P 49-61
%V 15
%N 5
%I mathdoc
%U http://geodesic.mathdoc.fr/item/FPM_2009_15_5_a3/
%G ru
%F FPM_2009_15_5_a3
S. M. Dudakov. Sufficient conditions for effective translation of locally generic queries. Fundamentalʹnaâ i prikladnaâ matematika, Tome 15 (2009) no. 5, pp. 49-61. http://geodesic.mathdoc.fr/item/FPM_2009_15_5_a3/

[1] Vereschagin N. K., Shen A., Yazyki i ischisleniya, MTsNMO, M., 2000

[2] Dudakov S. M., “Translyatsionnyi rezultat dlya rasshirenii arifmetiki Presburgera odnomestnoi funktsiei, soglasovannoi so slozheniem”, Mat. zametki, 76:3 (2004), 362–371 | DOI | MR | Zbl

[3] Dudakov S. M., “Translyatsionnaya teorema dlya teorii $I$-svodimykh algebraicheskikh sistem”, Izv. RAN. Ser. mat., 68:5 (2004), 67–90 | DOI | MR | Zbl

[4] Baldwin J., Benedikt M., “Stability theory, permutations of indiscernibles, and embedded finite models”, Trans. Amer. Math. Soc., 352:11 (2000), 4937–4969 | DOI | MR | Zbl

[5] Belegradek O. V., Stolboushkin A. P., Taitslin M. A., “Extended order-generic queries”, Ann. Pure Appl. Logic, 97 (1999), 85–125 | DOI | MR | Zbl

[6] Benedict M., Dong G., Libkin L., Wong L., “Relational expressive power of constraint query languages”, Proc. 15th ACM Symp. on Principles of Database Systems, Montreal, 1996, 5–16

[7] Chang C. C., Keisler H. J., Model Theory, North-Holland, Amsterdam, 1990 | MR

[8] Taitslin M. A., “A general condition for collapse results”, Ann. Pure Appl. Logic, 113 (2002), 323–330 | DOI | MR | Zbl