5 problems
Matching
Let be an effective enumeration of the computably enumerable sets, and write when the two sets lie in the same orbit under automorphisms o…
Let be a c.e. set. It has the outer splitting property if there are computable functions such that, for every , ,…
Let be a c.e. set. Its complement is semilow when the corresponding semilowness property holds, and is low when . Two c.e. sets are au…
Let be a c.e. set whose orbit is properly for a finite , as in Theorem 3.2, and let denote the infinitary logic use…
Let be a computably enumerable set and let be a Turing degree. Write for the Turing jump of , and let denote the lattice structure a…