Pseudo-Complex Quantifier Elimination
Symbolic Computation
2026-04-30 v1 Logic in Computer Science
Abstract
We describe the design of a quantifier elimination framework for the complex numbers in the language of ordered rings supplemented with symbols for the imaginary unit, real parts, imaginary parts, and conjugates. Technically, we use a reduction to real quantifier elimination followed by a heuristic reinterpretation of the results within our complex framework. We present computational examples using a prototypical implementation of our approach in our Python-based open-source system Logic1.
Cite
@article{arxiv.2604.26400,
title = {Pseudo-Complex Quantifier Elimination},
author = {Nicolas Faroß and Thomas Sturm},
journal= {arXiv preprint arXiv:2604.26400},
year = {2026}
}