




















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}$.
From: Jason Block [view email]
[v1]
Wed, 28 Jan 2026 23:18:39 UTC (38 KB)
[v2]
Wed, 18 Mar 2026 15:46:28 UTC (36 KB)
[v3]
Tue, 16 Jun 2026 19:26:54 UTC (37 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。