I PRIKLADNAYA MATEMATIKA
(FUNDAMENTAL AND APPLIED MATHEMATICS)
2009, VOLUME 15, NUMBER 5, PAGES 49-61
S. M. Dudakov
View as HTML View as gif image
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.
|Main page||Contents of the journal||News||Search|
Last modified: October 8, 2010