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 Σ1 equivalence relations on hyperarithmetical subsets of ω. 


Cite this paper

@article{Fokina2012IsomorphismRO, title={Isomorphism relations on computable structures}, author={Ekaterina B. Fokina and Sy-David Friedman and Valentina S. Harizanov and Julia F. Knight and Charles F. D. McCoy and Antonio Montalb{\'a}n}, journal={J. Symb. Log.}, year={2012}, volume={77}, pages={122-132} }