2000 character limit reached
Scott Complexity of Reduced Abelian -Groups
Published 9 Jul 2024 in math.LO and math.GR | (2407.06940v1)
Abstract: Given a reduced abelian -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 . Along the way, we give a largely algebraic characterization of the back-and-forth relations on reduced abelian -groups, making progress on an open problem from the book by Ash and Knight.
Paper Prompts
Sign up for free to create and run prompts on this paper.