2000 character limit reached
Elementary equivalence of the automorphism groups of reduced Abelian p-groups
Published 9 Jul 2012 in math.GR and math.LO | (1207.1951v1)
Abstract: Consider unbounded reduced Abelian p-groups (p > 2) A and A'. In this paper, we prove that if the automorphism groups Aut A and Aut A' are elementary equivalent then the groups A and A' are equivalent in the second order logic bounded by the final rank of the basic subgroups of A and A'.
Paper Prompts
Sign up for free to create and run prompts on this paper.