J ason E lias B lock . Computability Theoretic Aspects of Profinite Groups and Models of Presburger Arithmetic . The City University of New York Graduate Center. 2025. Supervised by Russell G. Miller. MSC: 03D30. Keywords: Computable structure theory, tree presentations, Scott analysis.
The Bulletin of Symbolic Logic · 2026-06 · 32 (2) · 355-356
DOI: 10.1017/bsl.2026.10138 ↗Kurz gefasst
Fachartikel in der Zeitschrift The Bulletin of Symbolic Logic, online erschienen am 23.06.2026.
Abstract (Originalsprache)
As suggested by the title, this thesis consists of two parts: profinite groups, and models of Presburger arithmetic. Profinite groups are covered in chapters 2–4, and chapters 5–7 cover Presburger arithmetic. Chapter 1 contains a brief introduction to computability and computable structure theory. In Chapter 2, we give an overview of profinite groups and of tree presentations. We describe how to represent size continuum profinite groups using countable tree presentations and discuss past results about the computability of profinite groups from the literature. Chapter 3 examines the possible complexities of first-order theories of profinite groups. In particular, we find upper bounds for both the existential and positive first-order theories. We distinguish the class of profinite groups that are isomorphic to a direct product of finite groups, for which we get tighter upper bounds on the complexity of existential theories as well as upper bounds for the complexity of entire first-order theories. Additionally, we demonstrate that these bounds are sharp. In Chapter 4, we examine certain countable subgroups of profinite groups. Given a Turing ideal I and a profinite group G , we define G I $G_I$ upper G Subscript upper I to be the subgroup of all elements in G whose Turing degree lies in I . We examine under what conditions and to what extent G I $G_I$ upper G Subscript upper I will be an elementary subgroup of G . In particular, we show that there exists a profinite group whose subgroup of computable elements is not elementary even for existential formulas. Chapter 5 provides an overview of Presburger arithmetic as well as some historical notes. We discuss divisible ordered abelian groups and their connection to Presburger groups. Additionally, we examine Presburger groups that are generated by a single nontrivial generator and show that almost all of these groups are rigid. In Chapter 6, we look at the possible degree spectra of Presburger groups. We show how given a countable linear order L $\mathcal {L}$ script upper L , one can construct a countable Presburger group P L $P_{\mathcal {L}}$ upper P Subscript script upper L such that the degree spectrum of P L $P_{\mathcal {L}}$ upper P Subscript script upper L is the set of Turing degrees whose jump is in the degree spectrum of L $\mathcal {L}$ script upper L . This yields many interesting degree spectra for Presburger groups. Chapter 7 deals with the possible Scott ranks of Presburger groups. We show that the Scott spectrum of Presburger arithmetic is complete. That is, given any countable ordinal α > 1 $\alpha>1$ alpha greater than 1 , there exists a Presburger group whose Scott rank is α $\alpha $ alpha . This further distinguishes Presburger arithmetic from Peano arithmetic, as no model of Peano arithmetic can have a finite Scott rank other than 1 $1$ 1 . Abstract prepared by Jason Block. E-mail: jeblock@wm.edu . URL: https://sites.google.com/view/jasonblockmath/ .
Zitieren
APA
(2026). J ason E lias B lock . Computability Theoretic Aspects of Profinite Groups and Models of Presburger Arithmetic . The City University of New York Graduate Center. 2025. Supervised by Russell G. Miller. MSC: 03D30. Keywords: Computable structure theory, tree presentations, Scott analysis. The Bulletin of Symbolic Logic, 32(2), 355-356. https://doi.org/10.1017/bsl.2026.10138
Vancouver
J ason E lias B lock . Computability Theoretic Aspects of Profinite Groups and Models of Presburger Arithmetic . The City University of New York Graduate Center. 2025. Supervised by Russell G. Miller. MSC: 03D30. Keywords: Computable structure theory, tree presentations, Scott analysis. The Bulletin of Symbolic Logic. 2026;32(2):355-356. doi:10.1017/bsl.2026.10138
BibTeX
@article{euvimed2026,
title = {J ason E lias B lock . Computability Theoretic Aspects of Profinite Groups and Models of Presburger Arithmetic . The City University of New York Graduate Center. 2025. Supervised by Russell G. Miller. MSC: 03D30. Keywords: Computable structure theory, tree presentations, Scott analysis},
journal = {The Bulletin of Symbolic Logic},
year = {2026},
volume = {32},
number = {2},
pages = {355--356},
doi = {10.1017/bsl.2026.10138}
}
EUVIMED