A quantifier elimination framework for complex numbers is designed via reduction to real QE followed by heuristic reinterpretation, with examples in the Logic1 system.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
For quadratic fields with 3-class group (Z/3Z)^2 and given 3-principalization types, the paper states exact criteria for metabelian 3-class towers of length 2 or 3 and computes minimal discriminants experimentally under GRH for nilpotency classes up to 11.
citing papers explorer
-
Pseudo-Complex Quantifier Elimination
A quantifier elimination framework for complex numbers is designed via reduction to real QE followed by heuristic reinterpretation, with examples in the Logic1 system.
-
3-class field towers with 2 or 3 stages
For quadratic fields with 3-class group (Z/3Z)^2 and given 3-principalization types, the paper states exact criteria for metabelian 3-class towers of length 2 or 3 and computes minimal discriminants experimentally under GRH for nilpotency classes up to 11.