Pith. sign in

Simplification of quantifier-free formulae over ordered fields

Andreas Dolzmann, Thomas Sturm · 1997 · Journal of Symbolic Computation · DOI 10.1006/jsco.1997.0123 · arXiv 1997.0123

1 Pith paper cite this work, alongside 82 external citations. Polarity classification is still indexing.

1 Pith paper citing it
82 external citations · external index
open at publisher browse 1 citing papers arXiv PDF

fields

cs.SC 1

years

2026 1

verdicts

UNVERDICTED 1

representative citing papers

Pseudo-Complex Quantifier Elimination

cs.SC · 2026-04-29 · unverdicted · novelty 6.0

A quantifier elimination framework for complex numbers is obtained via reduction to real quantifier elimination followed by heuristic reinterpretation, prototyped in the Logic1 system.

citing papers explorer

Showing 1 of 1 citing paper.

  • Pseudo-Complex Quantifier Elimination cs.SC · 2026-04-29 · unverdicted · none · ref 14

    A quantifier elimination framework for complex numbers is obtained via reduction to real quantifier elimination followed by heuristic reinterpretation, prototyped in the Logic1 system.