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.