On Dark Computably Enumerable Equivalence Relations

Research output: Contribution to journal › Article › peer-review

Original language	English
Pages (from-to)	22-30
Number of pages	9
Journal	Siberian Mathematical Journal
Volume	59
Issue number	1
DOIs	https://doi.org/10.1134/S0037446618010032
Publication status	Published - 1 Jan 2018

computable reducibility, computably enumerable equivalence relation, computably enumerable order, equivalence relation, lo-reducibility, weakly precomplete equivalence relation

ID: 10453842