Pseudo-Complex Quantifier Elimination
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910177290092544 |
|---|---|
| author | Faroß, Nicolas Sturm, Thomas |
| author_facet | Faroß, Nicolas Sturm, Thomas |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_26400 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Pseudo-Complex Quantifier Elimination Faroß, Nicolas Sturm, Thomas Symbolic Computation Logic in Computer Science 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. |
| title | Pseudo-Complex Quantifier Elimination |
| topic | Symbolic Computation Logic in Computer Science |
| url | https://arxiv.org/abs/2604.26400 |