On dark computably enumerable equivalence relations

DOI10.1134/S0037446618010032zbMath1406.03057OpenAlexW2792971020WikidataQ130184918 ScholiaQ130184918MaRDI QIDQ1642296

Nikolay Bazhenov, B. S. Kalmurzayev

Publication date: 20 June 2018

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0037446618010032

zbMATH Keywords

equivalence relation\(lo\)-reducibilitycomputable reducibilitycomputably enumerable equivalence relationcomputably enumerable orderweakly precomplete equivalence relation

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45)

Related Items (6)

Special classes of positive preorders ⋮ Index sets for classes of positive preorders ⋮ On universal positive graphs ⋮ The structure of computably enumerable preorder relations ⋮ Weakly precomplete equivalence relations in the Ershov hierarchy ⋮ Rogers semilattices for families of equivalence relations in the Ershov hierarchy

Cites Work

• Unnamed Item
• On weakly pre-complete positive equivalences
• Reducibilities among equivalence relations induced by recursively enumerable structures
• Turing degrees of certain isomorphic images of computable relations
• Positive equivalences
• Weakly precomplete computably enumerable equivalence relations
• UNIVERSAL COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS
• A Survey on Universal Computably Enumerable Equivalence Relations
• THE COMPLEXITY OF INDEX SETS OF CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS
• A Note on Positive Equivalence Relations
• LINEAR ORDERS REALIZED BY C.E. EQUIVALENCE RELATIONS
• Classifying positive equivalence relations
• Computably enumerable equivalence relations

This page was built for publication: On dark computably enumerable equivalence relations