ON THE wtt-REDUCIBILITY

Author: Roland Omanadze
Keywords: c.e. set, wtt-reducibility, bwtt-reducibility, Q-reducibility, bsQ-reducibility
Annotation:

We prove that every noncomputable c.e. wtt-degree contains a c.e. set A such that the Q-degree of A contains neither simple nor nowhere simple sets. We show that every noncomputable c.e. bwtt-degree contains infinite many pairwise bsQ-incomparable c.e. sets.

Lecture files:

ON THE wtt-REDUCIBILITY [en]
wtt-დაყვანადობის შესახებ [ka]