Elementary recursive quantifier elimination based on Thom encoding and sign determination
classification
🧮 math.AG
cs.CCmath.LO
keywords
algorithmdeterminationelementaryeliminationencodingquantifierrecursivesign
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.