vix.ing · top · new · best · stats · spec

Pseudo-Complex Quantifier Elimination

2026/04/29 by Nicolas Faroß, Thomas Sturm · 1 voice
Computer Science · #Algebra over a field #Formal Methods in Verification #Heuristic #Heuristics #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #Quantifier (linguistics) #Quantifier elimination #Reduction (mathematics) #cs.LO #cs.SC

paper · pdf · doi:10.48550/arxiv.2604.26400

openalex publication_date 2026/04/29 · arxiv published 2026/04/29 · openalex created_date 2026/05/01 · arxiv updated 2026/06/11 · openalex updated_date 2026/07/28

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.

Citations

Discussions

Related