| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 5778115 | Annals of Pure and Applied Logic | 2017 | 17 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Logic
Authors
Daniel Perrucci, Marie-Françoise Roy,