Papers
Topics
Authors
Recent
Search
2000 character limit reached

Scott Complexity of Reduced Abelian pp-Groups

Published 9 Jul 2024 in math.LO and math.GR | (2407.06940v1)

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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 1 like about this paper.