English

Scott Complexity of Reduced Abelian $p$-Groups

Logic 2024-07-10 v1 Group Theory

Abstract

Given a reduced abelian pp-group, we give an upper bound on the Scott complexity of the group in terms of its Ulm invariants. For limit ordinals, we show that this upper bound is tight. This gives an explicit sequence of such groups with arbitrarily high Scott complexity below ω1\omega_1. Along the way, we give a largely algebraic characterization of the back-and-forth relations on reduced abelian pp-groups, making progress on an open problem from the book by Ash and Knight.

Keywords

Cite

@article{arxiv.2407.06940,
  title  = {Scott Complexity of Reduced Abelian $p$-Groups},
  author = {Rachael Alvir and Barbara F. Csima and Luke MacLean},
  journal= {arXiv preprint arXiv:2407.06940},
  year   = {2024}
}

Comments

20 pages

R2 v1 2026-06-28T17:34:28.870Z