News
Let ≤c be computable the reducibility on computably enumerable equivalence relations (or ceers). We show that for every ceer R with infinitely many equivalence classes, the index sets {i : Ri ≤c R} ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results