On the existence of the tt-mitotic Low Set, which is not btt-mitotic

Let us adduce some definitions: If a computably enumerable (ce.) set A is a disjoint union of two sets B and C, then we say that B, C is a ce. splitting of A. A c.e. set A is tt-mitotic (btt-mitotic) if there is a ce. Splitting (B, Q of A such that the sets B and C both belong to the same tt- (btt-) degree of unsolvability, as the set A. In this paper it is proved, that there exists a tt-mitotic low set, which is not oft-mitotic.