MODNET
Research Training Network in Model Theory
Publications > Preprint server > Preprint Number 1092

Preprint Number 1092

Previous Next Preprint server


1092. Daniel Perrucci and Marie-Françoise Roy
Elementary recursive quantifier elimination based on Thom encoding and sign determination
E-mail:

Submission date: 9 September 2016

Abstract:

We describe a new quantifier elimination algorithm for real closed fields based on Thom encoding and sign determination. The complexity of this algorithm is elementary recursive and its proof of correctness is completely algebraic. In particular, the notion of connected components of semialgebraic sets is not used.

Mathematics Subject Classification: 14P10, 03C10

Keywords and phrases:

Full text arXiv 1609.02879: pdf, ps.


Last updated: September 23 2016 17:17 Please send your corrections to: