On the decidability of Presburger arithmetic expanded with powers

DOI10.1137/1.9781611978322.89MaRDI QIDQ7289656zbMATH OpenFDO

Authors Toghrul Karimov, Florian Luca, Joël Ouaknine, James Worrell

Publication date 3 July 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1137/1.9781611978322.89

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(2)

• One-parametric Presburger arithmetic has quantifier elimination
• Submonoid membership in n-dimensional lamplighter groups and S-unit equations

This page was built for publication: On the decidability of Presburger arithmetic expanded with powers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7289656)