Isomorphism relations on computable structures

Journal of Symbolic Logic 77 (1):122-132 (2012)

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 ${\mathrm{\Sigma }}_{1}^{1}$ equivalence relations on hyperarithmetical subsets of ω
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2178/jsl/1327068695
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 48,902
Through your library

References found in this work BETA

View all 11 references / Add more references

Citations of this work BETA

Computable Abelian Groups.Alexander G. Melnikov - 2014 - Bulletin of Symbolic Logic 20 (3):315-356,.
Jumps of Computably Enumerable Equivalence Relations.Uri Andrews & Andrea Sorbi - 2018 - Annals of Pure and Applied Logic 169 (3):243-259.
Torsion-Free Abelian Groups with Optimal Scott Families.Alexander G. Melnikov - 2018 - Journal of Mathematical Logic 18 (1):1850002.

Add more citations

Similar books and articles

Degree Spectra of Relations on Computable Structures.Denis R. Hirschfeldt - 2000 - Bulletin of Symbolic Logic 6 (2):197-212.
Spectra of Structures and Relations.Valentina S. Harizanov & Russel G. Miller - 2007 - Journal of Symbolic Logic 72 (1):324 - 348.
A Theorem on the Isomorphism Property.Renling Jin - 1992 - Journal of Symbolic Logic 57 (3):1011-1017.
Isomorphism Types of Maximal Cofinitary Groups.Bart Kastermans - 2009 - Bulletin of Symbolic Logic 15 (3):300-319.


Added to PP index

Total views
36 ( #259,953 of 2,310,061 )

Recent downloads (6 months)
6 ( #160,089 of 2,310,061 )

How can I increase my downloads?


My notes

Sign in to use this feature