English

On the Decidability of Presburger Arithmetic Expanded with Powers

Logic in Computer Science 2025-07-22 v2

Abstract

We prove that for any integers α,β>1\alpha, \beta > 1, the existential fragment of the first-order theory of the structure Z;0,1,<,+,αN,βN\langle \mathbb{Z}; 0,1,<, +, \alpha^{\mathbb{N}}, \beta^{\mathbb{N}}\rangle is decidable (where αN\alpha^{\mathbb{N}} is the set of positive integer powers of α\alpha, and likewise for βN\beta^{\mathbb{N}}). On the other hand, we show by way of hardness that decidability of the existential fragment of the theory of N;0,1,<,+,xαx,xβx\langle \mathbb{N}; 0,1, <, +, x\mapsto \alpha^x, x \mapsto \beta^x\rangle for any multiplicatively independent α,β>1\alpha,\beta > 1 would lead to mathematical breakthroughs regarding base-α\alpha and base-β\beta 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

R2 v1 2026-06-28T17:31:34.216Z