Order:
  1.  24
    Back-and-forth systems for generic curves and a decision algorithm for the limit theory.Pascal Koiran & Natacha Portier - 2001 - Annals of Pure and Applied Logic 111 (3):257-275.
    It was recently shown that the theories of generic algebraic curves converge to a limit theory as their degrees go to infinity. In this paper we give quantitative versions of this result and other similar results. In particular, we show that generic curves of degree higher than 22r cannot be distinguished by a first-order formula of quantifier rank r. A decision algorithm for the limit theory then follows easily. We also show that in this theory all formulas are equivalent to (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  2.  29
    Le problème Des granDes puissances et celui Des granDes racines.Natacha Portier - 2000 - Journal of Symbolic Logic 65 (4):1675-1685.
    Let f be a function from N to N that can not be computed in polynomial time, and let a be an element of a differential field K of characteristic 0. The problem of large powers is the set of tuples x̄ = (x 1 ,..., x n ) of K so that x 1 = a f(n) , and the problem of large roots is the set of tuples x̄ of K so that x f(n) 1 = a. These (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark  
  3.  60
    Stabilité polynômiale Des corps différentiels.Natacha Portier - 1999 - Journal of Symbolic Logic 64 (2):803-816.
    A notion of complexity for an arbitrary structure was defined in the book of Poizat Les petits cailloux (1995): we can define P and NP problems over a differential field K. Using the Witness Theorem of Blum et al., we prove the P-stability of the theory of differential fields: a P problem over a differential field K is still P when restricts to a sub-differential field k of K. As a consequence, if P = NP over some differentially closed field (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   1 citation