On the Decidability of Presburger Arithmetic Expanded with Powers
Logic in Computer Science
2025-07-22 v2
Abstract
We prove that for any integers , the existential fragment of the first-order theory of the structure is decidable (where is the set of positive integer powers of , and likewise for ). On the other hand, we show by way of hardness that decidability of the existential fragment of the theory of for any multiplicatively independent would lead to mathematical breakthroughs regarding base- and base- expansions of certain transcendental numbers.
Keywords
Cite
@article{arxiv.2407.05191,
title = {On the Decidability of Presburger Arithmetic Expanded with Powers},
author = {Toghrul Karimov and Florian Luca and Joris Nieuwveld and Joël Ouaknine and James Worrell},
journal= {arXiv preprint arXiv:2407.05191},
year = {2025}
}
Comments
SODA 2025