Undecidability conjecture for rapidly growing generalised polynomials

From papers

Let g ⁣:ZZg \colon \mathbb{Z} \to \mathbb{Z} be a generalised polynomial such that

lim infng(n)/n2>0.\liminf_{n \to \infty} \left|g(n)\right|/n^2 > 0.

Undecidability conjecture. The first-order theory of (Z;<,+,g)(\mathbb{Z};<,+,g) 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 22.

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

No solutions have been posted yet.