Decidability of Univariate Real Algebra with Predicates for Rational and Integer Powers
classification
🧮 math.LO
cs.LO
keywords
rationalrealalgebraalgebraicdecidabilityintegermathbbpowers
read the original abstract
We prove decidability of univariate real algebra extended with predicates for rational and integer powers, i.e., $(x^n \in \mathbb{Q})$ and $(x^n \in \mathbb{Z})$. Our decision procedure combines computation over real algebraic cells with the rational root theorem and witness construction via algebraic number density arguments.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.