M. Ajtai, 1 1 -formulae on nite structures, Ann. Pure A p p l . L ogic, vol.24, pp.1-48, 1983.

S. Basu, An improved algorithm for quantiier elimination over real closed elds, 38th IEEE Symposium on Foundations of Computer Science, 5 6 { 65, 1997.

S. Basu, R. Pollack, and M. Roy, On the combinatorial and algebraic complexity of quantiier-elimination, J. ACM, vol.43, pp.1002-1045, 1996.

M. Benedikt, G. Dong, L. Libkin, and L. Wong, Relational expressive p o wer of constraint query languages, J. ACM, vol.45, pp.1-34, 1998.

M. Benedikt and L. Libkin, On the structure of queries in constraint q u e r y languages, In: 11th Annual IEEE Symposium on Logic in Computer Science, pp.25-34, 1996.

M. Benedikt and L. Libkin, Languages for relational databases over interpreted structures, Proceedings of the 16th ACM Symposium on Principles of Database Systems, vol.87, 1997.

A. Borovik and A. Nesin, Groups of nite Morley rank, 1994.

L. Caniglia, A. Galligo, and J. Heintz, Borne simple exponentielle pour les degr es dans le th eor eme des z eros sur un corps de caract eristique quelconque, C. R. Acad. Sci. Paris Serie I, vol.307, pp.255-258, 1988.

L. Van-den-dries and K. Schmidt, Bound in the theory of polynomials rings over elds. A nonstandard approach, vol.76, pp.77-91, 1984.

N. Fitchas, A. Galligo, and J. Morgenstern, Precise sequential and parallel complexity bounds for quantiier elimination over algebraically closed elds, J. Pure Appl. Algebra, vol.67, pp.1-14, 1990.

M. Furst, J. Saxe, and M. Sipser, Parity, circuits and the polynomial-time hierarchy, Math. Systems Theory, vol.17, pp.13-27, 1984.

S. Grumbach and J. Su, Queries with arithmetical constraints, Theoret. Comput. Sci, vol.173, pp.151-181, 1997.

S. Grumbach, J. Su, and C. Tollu, Linear constraint query languages: Expressive p o wer and complexity, I n : Logic and computational complexity, Lecture Notes in Comput. Sci, vol.426, issue.446, 1994.

J. , Computational limitations for small depth circuits, 1987.

W. A. Hodges, Model theory, C a m bridge University Press, 1993.

P. Koiran, Eliminationof parameters in the polynomial hierarchy, LIP research report, pp.98-113, 1998.

J. , Sharp eeective Nullstellensatz, J. Amer. Math. Soc, vol.1, pp.963-975, 1988.

M. Li and P. Vitt, An I n t r oduction to Kolmogorov Complexity and its Applications, 1997.

B. Poizat, Cours de th eorie des mod eles, Nur al'Mantiq wal-Ma'rifah, Villeurbanne, 1985.

A. Seidenberg, Constructions in algebra, Trans. Amer. Math. Soc, vol.197, pp.273-313, 1974.

I. Shafarevich, Basic Algebraic Geometry 2, 1994.

A. Yao, Separating the polynomial-time hierarchy b y oracles, Proc. 26th IEEE Symposium on Foundations of Computer Science, 1{10, 1985.