Decidability of extensions of Presburger arithmetic by generalised polynomials
From MaRDI portal
Cites work
- A canonical form and the distribution of values of generalized polynomials
- A list of arithmetical structures complete with respect to the first-order definability
- A strong version of Cobham’s theorem
- Automatic Sequences
- Bracket words: A generalisation of Sturmian words arising from generalised polynomials
- Correction to: Logic and p-recognizable sets of integers
- Critical exponent of infinite balanced words via the Pell number system
- Decidability for Sturmian words
- Decision algorithms for Fibonacci-automatic words. I: Basic results.
- Decision algorithms for Fibonacci-automatic words. II: Related sequences and avoidability
- Decision algorithms for Fibonacci-automatic words. III: Enumeration and abelian properties.
- Definability and decision problems in arithmetic
- Distribution of values of bounded generalized polynomials
- Equidistribution of sparse sequences on nilmanifolds
- scientific article; zbMATH DE number 545277 (Why is no real title available?)
- scientific article; zbMATH DE number 1827828 (Why is no real title available?)
- scientific article; zbMATH DE number 3237829 (Why is no real title available?)
- Logic and p-recognizable sets of integers
- LOGICAL THEORIES OF ONE-PLACE FUNCTIONS ON THE SET OF NATURAL NUMBERS
- ON CERTAIN EXTENSIONS OF THE ARITHMETIC OF ADDITION OF NATURAL NUMBERS
- Ostrowski numeration systems, addition, and finite automata
- Sparse generalised polynomials
- The quantitative behaviour of polynomial orbits on nilmanifolds
- Undefinability of multiplication in Presburger arithmetic with sets of powers
- Uniform distribution and Hardy fields
This page was built for publication: Decidability of extensions of Presburger arithmetic by generalised polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6858457)
