Isomorphism relations on computable structures.

We study the complexity of the isomorphism relation on classes of computable structures. We use the notion of FF-reducibility introduced in [9] to show completeness of the isomorphism relation on many familiar classes in the context of all Sigma(1)(1) equivalence relations on hyperarithmetical subsets of omega.