English

Undefinability of multiplication in Presburger arithmetic with sets of powers

Logic 2022-09-27 v1

Abstract

We begin by proving that any Presburger-definable image of one or more sets of powers has zero natural density. Then, by adapting the proof of a dichotomy result on o-minimal structures by Friedman and Miller, we produce a similar dichotomy for expansions of Presburger arithmetic on the integers. Combining these two results, we obtain that the expansion of the ordered group of integers by any number of sets of powers does not define multiplication.

Keywords

Cite

@article{arxiv.2209.11858,
  title  = {Undefinability of multiplication in Presburger arithmetic with sets of powers},
  author = {Christian Schulz},
  journal= {arXiv preprint arXiv:2209.11858},
  year   = {2022}
}

Comments

15 pages