The clearly intuitive answer is no. But I'm unsure of how to prove this, as there are no nontrivial automorphisms of $(\mathbb{N}, +)$, so the standard method doesn't work. What is the correct approach here?
Asked
Active
Viewed 107 times
1
-
2Some helpful vocabulary: the natural numbers with addition is called Presburger Arithmetic and the first-order definable subsets are called semilinear sets (a generalization of eventually periodic sets to multiple dimensions) – TomKern Dec 20 '23 at 02:29
1 Answers
6
The definable sets in $(\mathbb{N};+)$ are all eventually periodic - this follows from the usual quantifier-elimination (in an expanded language) argument used to show the completeness of Presburger arithmetic - so the answer to your question is negative (and we can similarly use this to rule out the existence of a definable pairing function and similar constructions). But indeed this takes more work than a simple automorphism construction, and I'm not aware of any proof that doesn't go through some form of QE.
Noah Schweber
- 245,398