Possibly Related Publications

The following publications are possibly variants of this publication:

• Universal computably Enumerable Equivalence RelationsUri Andrews, Steffen Lempp, Joseph S. Miller, Keng Meng Ng, Luca San Mauro, Andrea Sorbi. JSYML, 79(1):60-88, 2014. [doi]
• On Isomorphism Classes of computably Enumerable Equivalence RelationsUri Andrews, Serikzhan A. Badaev. JSYML, 85(1):61-86, 2020. [doi]
• Weakly precomplete computably enumerable equivalence relationsSerikzhan A. Badaev, Andrea Sorbi. mlq, 62(1-2):111-127, 2016. [doi]
• A Survey on Universal Computably Enumerable Equivalence RelationsUri Andrews, Serikzhan A. Badaev, Andrea Sorbi. BIRTHDAY 2017: 418-451 [doi]
• The Complexity of Index Sets of Classes of computably Enumerable Equivalence RelationsUri Andrews, Andrea Sorbi. JSYML, 81(4):1375-1395, 2016. [doi]
• The first-order theory of the computably enumerable equivalence relations in the uncountable settingUri Andrews, Steffen Lempp, Manat Mustafa, Noah David Schweber. logcom, 32(1):98-114, 2022. [doi]