The Hierarchy of Equivalence Relations on the Natural Numbers Under Computable Reducibility
From MaRDI portal
Publication:4904456
DOI10.3233/COM-2012-004zbMath1325.03049arXiv1109.3375OpenAlexW1636748716MaRDI QIDQ4904456
Samuel Coskey, Joel David Hamkins, Russell G. Miller
Publication date: 30 January 2013
Published in: Computability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1109.3375
Descriptive set theory (03E15) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items (13)
Primitive recursive equivalence relations and their primitive recursive complexity ⋮ Agreement reducibility ⋮ ON THE STRUCTURE OF COMPUTABLE REDUCIBILITY ON EQUIVALENCE RELATIONS OF NATURAL NUMBERS ⋮ COMPUTABLE REDUCIBILITY OF EQUIVALENCE RELATIONS AND AN EFFECTIVE JUMP OPERATOR ⋮ Reducibilities among equivalence relations induced by recursively enumerable structures ⋮ Jumps of computably enumerable equivalence relations ⋮ Learning algebraic structures with the help of Borel equivalence relations ⋮ Classifying equivalence relations in the Ershov hierarchy ⋮ A Survey on Universal Computably Enumerable Equivalence Relations ⋮ Uniform Martin’s conjecture, locally ⋮ On the degree structure of equivalence relations under computable reducibility ⋮ On \(\Delta_2^0\)-categoricity of equivalence relations ⋮ Graphs realised by r.e. equivalence relations
This page was built for publication: The Hierarchy of Equivalence Relations on the Natural Numbers Under Computable Reducibility
