ON ISOMORPHISM CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS
From MaRDI portal
Publication:5107218
DOI10.1017/jsl.2019.39zbMath1452.03092OpenAlexW2949113769MaRDI QIDQ5107218
Publication date: 17 April 2020
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/jsl.2019.39
computably enumerable equivalence relationcomputable reducibility on equivalence relationshalting jump
Related Items (7)
Index sets for classes of positive preorders ⋮ Uniformly computably separable algebras with effectively splittable families of negative congruences ⋮ INITIAL SEGMENTS OF THE DEGREES OF CEERS ⋮ The theory of ceers computes true arithmetic ⋮ Word problems and ceers ⋮ On the main scientific achievements of Victor Selivanov ⋮ On universal positive graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computability and complexity. Essays dedicated to Rodney G. Downey on the occasion of his 60th birthday
- Reducibilities among equivalence relations induced by recursively enumerable structures
- Positive equivalences
- Jumps of computably enumerable equivalence relations
- Graphs realised by r.e. equivalence relations
- Weakly precomplete computably enumerable equivalence relations
- 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
- Joins and meets in the structure of ceers
- Finitely presented expansions of groups, semigroups, and algebras
- Computably enumerable equivalence relations
This page was built for publication: ON ISOMORPHISM CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS