The complexity of index sets of classes of computably enumerable equivalence relations

DOI10.1017/JSL.2016.26zbMATH Open1403.03062OpenAlexW2558322769MaRDI QIDQ2976337FDOQ2976337

Uri Andrews, Andrea Sorbi

Publication date: 28 April 2017

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/1d468be032e7585ebbe61a483f67e6e7dd40e5b1

Recommendations

• Weakly precomplete computably enumerable equivalence relations
• Weakly precomplete equivalence relations in the Ershov hierarchy
• Universal computably enumerable equivalence relations
• On isomorphism classes of computably enumerable equivalence relations
• On the degree structure of equivalence relations under computable reducibility

zbMATH Keywords

computably enumerable equivalence relationcomputable reducibility on equivalence relations

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (8)

• Subrecursive equivalence relations and (non-)closure under lattice operations
• On dark computably enumerable equivalence relations
• The number of nonequivalent computable indexations for a fixed family of sets
• Index sets for classes of positive preorders
• A Survey on Universal Computably Enumerable Equivalence Relations
• On Index Sets of Some Properties of Computable Algebras
• Title not available (Why is that?)
• ON ISOMORPHISM CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS

This page was built for publication: The complexity of index sets of classes of computably enumerable equivalence relations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2976337)