Weakly precomplete computably enumerable equivalence relations

Serikzhan A. Badaev, Andrea Sorbi. Weakly precomplete computably enumerable equivalence relations. Math. Log. Q., 62(1-2):111-127, 2016. [doi]

@article{BadaevS16,
  title = {Weakly precomplete computably enumerable equivalence relations},
  author = {Serikzhan A. Badaev and Andrea Sorbi},
  year = {2016},
  doi = {10.1002/malq.201500057},
  url = {http://dx.doi.org/10.1002/malq.201500057},
  researchr = {https://researchr.org/publication/BadaevS16},
  cites = {0},
  citedby = {0},
  journal = {Math. Log. Q.},
  volume = {62},
  number = {1-2},
  pages = {111-127},
}