Author:
Fokina Ekaterina B.,Friedman Sy-David,Harizanov Valentina,Knight Julia F.,Mccoy Charles,Montalbán Antonio
Abstract
AbstractWe 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 equivalence relations on hyperarithmetical subsets of ω.
Publisher
Cambridge University Press (CUP)
Reference28 articles.
1. Computable categoricity and the Ershov hierarchy
2. Ulm's theorem for partially ordered structures related to simply presented Abelian p-groups;Rogers;Transactions of the American Mathematical Society,1977
Cited by
58 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献