THE COMPLEXITY OF INDEX SETS OF CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS
From MaRDI portal
Publication:2976337
DOI10.1017/jsl.2016.26zbMath1403.03062MaRDI QIDQ2976337
Publication date: 28 April 2017
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/1d468be032e7585ebbe61a483f67e6e7dd40e5b1
03D25: Recursively (computably) enumerable sets and degrees
Related Items
ON ISOMORPHISM CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS, On dark computably enumerable equivalence relations, Subrecursive equivalence relations and (non-)closure under lattice operations, Index sets for classes of positive preorders, A Survey on Universal Computably Enumerable Equivalence Relations
Cites Work