Similar Items: Decidability of extensions of Presburger arithmetic by generalised polynomials
- Presburger Arithmetic with algebraic scalar multiplications
- On Presburger arithmetic extended with non-unary counting quantifiers
- Quadratic Word Equations with Length Constraints, Counter Systems, and Presburger Arithmetic with Divisibility
- Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds
- On Polynomial-Time Decidability of k-Negations Fragments of First-Order Theories
- Friendly primes for efficient modular arithmetic using the Polynomial Modular Number System