Back-and-forth systems for generic curves and a decision algorithm for the limit theory

DOI10.1016/S0168-0072(01)00027-6zbMath0985.03024MaRDI QIDQ5946087

Pascal Koiran, Natacha Portier

Publication date: 13 May 2002

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

zbMATH Keywords

generic curveback-and-forth systemlimit theory of generic curves

Mathematics Subject Classification ID

Decidability and field theory (12L05) Model-theoretic algebra (03C60)

Related Items (2)

The theory of Liouville functions ⋮ A rank theorem for Vandermonde matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fields
• Definability and fast quantifier elimination in algebraically closed fields
• On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• On the combinatorial and algebraic complexity of quantifier elimination
• La limite des theories de courbes generiques

This page was built for publication: Back-and-forth systems for generic curves and a decision algorithm for the limit theory