arXiv · 2407.05191
On the Decidability of Presburger Arithmetic Expanded with Powers
Abstract
We prove that for any integers $\alpha, \beta > 1$, the existential fragment of the first-order theory of the structure $\langle \mathbb{Z}; 0,1,<, +, \alpha^{\mathbb{N}}, \beta^{\mathbb{N}}\rangle$ is decidable (where $\alpha^{\mathbb{N}}$ is the set of positive integer powers of $\alpha$, and likewise for $\beta^{\mathbb{N}}$). On the other hand, we show by way of hardness that decidability of the existential fragment of the theory of $\langle \mathbb{N}; 0,1, <, +, x\mapsto \alpha^x, x \mapsto \beta^x\rangle$ for any multiplicatively independent $\alpha,\beta > 1$ would lead to mathematical breakthroughs regarding base-$\alpha$ and base-$\beta$ expansions of certain transcendental numbers.
Explore related subjects
Keep this discovery
Toghrul Karimov, Florian Luca, Joris Nieuwveld, Joël Ouaknine, James Worrell. 2024-07-06. On the Decidability of Presburger Arithmetic Expanded with Powers. https://arxiv.org/abs/2407.05191
Cite the original work for its findings. Save a collection to share your selection of sources.