Elementary recursive quantifier elimination based on Thom encoding and sign determination

Perrucci, Daniel Roberto; Roy, Marie Françoise

doi:https://doi.org/10.1016/j.apal.2017.03.001

Artículo

Elementary recursive quantifier elimination based on Thom encoding and sign determination

Perrucci, Daniel Roberto Icon

; Roy, Marie Françoise

Fecha de publicación: 08/2017

Editorial: Elsevier Science

Revista: Annals Of Pure And Applied Logic

ISSN: 0168-0072

Idioma: Inglés

Tipo de recurso: Artículo publicado

Clasificación temática:

Matemática Pura

Resumen

We describe a new quantifier elimination algorithm for real closed fields based onThom encoding and sign determination. The complexity of this algorithm is elemen-tary recursive and its proof of correctness is completely algebraic. In particular, thenotion of connected components of semialgebraic sets is not used.

Palabras clave: QUANTIFIER ELIMINATION , SIGN DETERMINATION , THOM ENCODING

Ver el registro completo

Archivos asociados

Tamaño: 405.5Kb

Formato: PDF

Descargar

Licencia

Excepto donde se diga explícitamente, este item se publica bajo la siguiente descripción: Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Unported (CC BY-NC-SA 2.5)

Identificadores

URI: http://hdl.handle.net/11336/159267

DOI: https://doi.org/10.1016/j.apal.2017.03.001

URL: https://www.sciencedirect.com/science/article/pii/S0168007217300325

Colecciones

Articulos(IMAS)
Articulos de INSTITUTO DE INVESTIGACIONES MATEMATICAS "LUIS A. SANTALO"

Citación

Perrucci, Daniel Roberto; Roy, Marie Françoise; Elementary recursive quantifier elimination based on Thom encoding and sign determination; Elsevier Science; Annals Of Pure And Applied Logic; 168; 8; 8-2017; 1588-1604

Altmétricas