The Isomorphism Problem for Computable Abelian p-Groups of Bounded Length

Details The Isomorphism Problem for Computable Abelian p-Groups of Bounded Length The Isomorphism Problem for Computable Abelian p-Groups of Bounded Length

2004-06-24

arxiv.org/abs/math/0406505v1

Mathematics

Logic

15 pages

Scientific paper

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider only countable members. This paper explores such a notion for classes of computable structures by working out a sequence of examples. We follow recent work by Goncharov and Knight in using the degree of the isomorphism problem for a class to distinguish classifiable classes from non-classifiable. In this paper, we calculate the degree of the isomorphism problem for Abelian $p$-groups of bounded Ulm length. The result is a sequence of classes whose isomorphism problems are cofinal in the hyperarithmetical hierarchy. In the process, new back-and-forth relations on such groups are calculated.

Affiliated with

Also associated with

No associations

Rating

The Isomorphism Problem for Computable Abelian p-Groups of Bounded Length does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Isomorphism Problem for Computable Abelian p-Groups of Bounded Length, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Isomorphism Problem for Computable Abelian p-Groups of Bounded Length will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-101927