DISTAL EXPANSIONS OF PRESBURGER ARITHMETIC BY A SPARSE PREDICATE
Abstract We prove that the structure $(\mathbb {Z},<,+,R)$ is distal for all congruence-periodic sparse predicates $R\subseteq \mathbb {N}$ . We do so by constructing a strong honest definition for every formula $\phi (x;y)$ with $\lvert {x}\rvert =1$ , providing a rare example of concrete distal decompositions.
Authors
- Mervyn Tong
Institutions
- University of Leeds (GB)
Publication Details
- Journal
- Journal of Symbolic Logic
- Published
- 2025-08-28
- DOI
- https://doi.org/10.1017/jsl.2025.10125
- Citations
- 1
- Primary Topic
- Computability, Logic, AI Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 1.50