Elementary recursive quantifier elimination based on Thom encoding and sign determination - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Annals of Pure and Applied Logic Année : 2017

Elementary recursive quantifier elimination based on Thom encoding and sign determination

Résumé

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.

Dates et versions

hal-01375410 , version 1 (03-10-2016)

Identifiants

Citer

Daniel Perrucci, Marie-Françoise Roy. Elementary recursive quantifier elimination based on Thom encoding and sign determination. Annals of Pure and Applied Logic, 2017, 168 (8), pp.1588-1604. ⟨10.1016/j.apal.2017.03.001⟩. ⟨hal-01375410⟩
193 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More