Salvato in:
Dettagli Bibliografici
Autore principale: Block, Jason
Natura: Preprint
Pubblicazione: 2026
Soggetti:
Accesso online:https://arxiv.org/abs/2601.21118
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
Sommario:
  • 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}$.