Undecidability conjecture for rapidly growing generalised polynomials
Undecidability conjecture for rapidly growing generalised polynomials
Let be a generalised polynomial such that
Undecidability conjecture. The first-order theory of is undecidable.
This conjecture proposes that adjoining any generalised polynomial with at least quadratic rate of growth to Presburger arithmetic destroys decidability, extending the known undecidability result for ordinary polynomial sequences of degree at least .
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Jakub Konieczny, “Decidability of extensions of Presburger arithmetic by generalised polynomials”, arXiv:2402.09647 (2025).
Additional references
2 papers in this index state this conjecture (2013–2024). The statement above is taken from the most recent of them; the others are arXiv:1309.7138.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.