Measuring the Complexity of Countable Presburger Models
Abstract
We take two approaches to classifying the complexity of Presburger models: Scott analysis and degree spectra. In particular, we investigate the possible Scott sentence complexities and possible degree spectra of models of Presburger arithmetic. Many of our results will be achieved by showing how given a linear order $\mathcal{L}$, we can construct a Presburger group $P_\mathcal{L}$ that maintains much of the structure of $\mathcal{L}$.
Fields of Study & Subjects
Advanced Topology and Set Theory
Computability
Logic
AI Algorithms
semigroups and automata theory
Publication details
- Journal / source
- arXiv (Cornell University)
- Publication date
- 28 January 2026
- Document type
- Preprint