Computability Theory Learning Seminar

Luke MacLean, Department of Pure Mathematics, University of Waterloo

"Back-and-forth relations of Abelian groups"

We will provide a partial characterization of the back-and-forth relations on countable reduced Abelian p-groups. This will, in turn, help us to provide upper bounds on the Scott complexities of such structures. This work relies heavily on Ulm's theorem, and so a proof sketch will be given.