THE COMPLEXITY OF INDEX SETS OF CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS

DOI10.1017/JSL.2016.26zbMath1403.03062OpenAlexW2558322769MaRDI QIDQ2976337

Uri Andrews, Andrea Sorbi

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

zbMATH Keywords

computably enumerable equivalence relationcomputable reducibility on equivalence relations

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Related Items (5)

On dark computably enumerable equivalence relations ⋮ Index sets for classes of positive preorders ⋮ ON ISOMORPHISM CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS ⋮ A Survey on Universal Computably Enumerable Equivalence Relations ⋮ Subrecursive equivalence relations and (non-)closure under lattice operations

Cites Work

• Reducibilities among equivalence relations induced by recursively enumerable structures
• Classical recursion theory. Vol. II
• Graphs realised by r.e. equivalence relations
• A Note on Positive Equivalence Relations
• Periodicity in generations of automata
• Computably enumerable equivalence relations

This page was built for publication: THE COMPLEXITY OF INDEX SETS OF CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS