On decidable extensions of Presburger arithmetic: from A. Bertrand numeration sytems to Pisot numbers
From MaRDI portal
Publication:4527928
DOI10.2307/2586704zbMath0971.03013OpenAlexW2076326799MaRDI QIDQ4527928
Publication date: 30 October 2001
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2586704
quantifier eliminationdecidabilityextensions of Presburger arithmetic with a unary predicatesparse predicate
Decidability of theories and sets of sentences (03B25) First-order arithmetic and fragments (03F30) Quantifier elimination, model completeness, and related topics (03C10)
Related Items (8)
A full characterization of Bertrand numeration systems ⋮ Automata and tame expansions of \((\mathbb{Z}, +)\) ⋮ Vapnik-Chervonenkis density in some theories without the independence property. II ⋮ On expansions of \((\mathbf{Z},+,0)\) ⋮ Elimination of unbounded quantifiers for some poly-regular groups of infinite rank ⋮ THERE ARE NO INTERMEDIATE STRUCTURES BETWEEN THE GROUP OF INTEGERS AND PRESBURGER ARITHMETIC ⋮ Vapnik-Chervonenkis density in some theories without the independence property, I ⋮ Defining Multiplication in Some Additive Expansions of Polynomial Rings
This page was built for publication: On decidable extensions of Presburger arithmetic: from A. Bertrand numeration sytems to Pisot numbers
