Skip to main content
Log in

Bounding quantification in parametric expansions of Presburger arithmetic

  • Published:
Archive for Mathematical Logic Aims and scope Submit manuscript

Abstract

Generalizing Cooper’s method of quantifier elimination for Presburger arithmetic, we give a new proof that all parametric Presburger families \(\{S_t : t \in \mathbb {N}\}\) [as defined by Woods (Electron J Comb 21:P21, 2014)] are definable by formulas with polynomially bounded quantifiers in an expanded language with predicates for divisibility by f(t) for every polynomial \(f \in \mathbb {Z}[t]\). In fact, this quantifier bounding method works more generally in expansions of Presburger arithmetic by multiplication by scalars \(\{\alpha (t): \alpha \in R, t \in X\}\) where R is any ring of functions from X into \(\mathbb {Z}\).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Woods, K.: The unreasonable ubiquitousness of quasi-polynomials. Electron. J. Comb. 21(1), #P1.44 (2014)

  2. Ehrhart, E.: Sur les polyèdres rationnels homothétiques à n dimensions. Comptes Rendues de l’Académie des Sciences, Paris 254, 616–618 (1962)

    MATH  Google Scholar 

  3. Roune, B.H., Woods, K.: The parametric frobenius problem, Electron. J. Comb. 22 (2015)

  4. Goodrick, J., Bogart, T., Woods, K.: Parametric Presburger arithmetic: logic, combinatorics, and quasi-polynomial behavior, Discr. Anal. (2017)

  5. Lasaruk, A., Sturm, T.: Weak quantifier elimination for the full linear theory of the integers. Appl. Algebr. Eng. Commun. Comput. 18(6), 545–574 (2007)

    Article  MATH  Google Scholar 

  6. Cooper, D.C.: Theorem proving in arithmetic without multiplication. Mach. Intell. 7, 91–100 (1972)

    MATH  Google Scholar 

  7. Glivický, P.: Study of arithmetical structures and theories with regard to representatives and descriptive analysis. Ph.D. Thesis, Charles University in Prague (2013)

  8. Weispfenning, V.: Complexity and uniformity of elimination in Presburger arithmetic. In: Proceedings of the 1997 International Symbosium on Symbolic and Algebraic Computation, pp. 48–53. ACM Press (1997)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to John Goodrick.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Goodrick, J. Bounding quantification in parametric expansions of Presburger arithmetic. Arch. Math. Logic 57, 577–591 (2018). https://doi.org/10.1007/s00153-017-0593-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00153-017-0593-0

Keywords

Mathematics Subject Classification

Navigation