The theory of liouville functions

Journal of Symbolic Logic

Volumn 68, Issue 2, 2003, Pages 353-365

  Koiran, Pascal ^a  

^a UNIV LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037495989     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2178/jsl/1052669055     Document Type: Article

References (11)

1. S. Basu, R. Pollack, and M.-F. Roy, On the combinatorial and algebraic complexity of quantifier elimination, Journal of the Association for Computing Machinery, vol. 43 (1996), no. 6, pp. 1002-1045.
2. L. Blüm, F. Cucker, M. Shub, and S. Smale, Complexity andreal computation, Springer-Verlag, 1998.
3. O. Chapuís, E. Hrushovski, P. Koiran, and B. PoizAt, La limite des theories de courbes generiques, this Journaal, vol. 67 (2002), no. 1, pp. 24-34.
4. P. Koiran, The limit theory of generic polynomials, Technical Report 01-35, LIP-Ecole Normale Superieure Lyon, 2001, To appear in Proceedings of Logic Colloquium 2001.
5. P. Koiran and N. Portier, Back-and-forth systems for generic curves and a decision algorithm for the limit theory, Annals ofPure and Applied Logic, vol. 111 (2001), pp. 257-275.
6. B. Poizat, Le carré de regalité, this JournaL, vol. 64 (1999), pp. 1339-1355.
7. B. Poizat, Amalgames de Hrushovski: une tentative de classification, preprint, 2000.
8. J. Renegar, On the computational complexity and geometry of the first-order theory of the reals. parts I, II, III, Journal of Symbolic Computation, vol. 13 (1992), no. 3, pp. 255-352.
9. A. J. Wilkie, Liouville functions, To appear in Proceedings of Logic Colloquium 2000.
10. B. Zilber, Analytic and pseudo-analytic structures, To appear in Proceedings of Logic Colloquium 2000.
11. B. Zilber, A theory of generic functions with derivatives, preprint.