TY - GEN
A1 - Mokatsian Arsen
N2 - Let us adduce some definitions: If a recursively enumerable (r.e.) set A is a disjoint union of two sets B and C, then we say that B, C is an r.e. splitting of A. The r.e. set A is tt-mitotic (btt-mitotic) if there is an r.e. splitting (B,C) 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 the existence of the tt - mitotic hypersimple set, which is not btt - mitotic is proved.
L1 - http://noad.sci.am/Content/135788/AAL7.pdf
L2 - http://noad.sci.am/Content/135788
T1 - On the Existence of the tt-Mitotic HypersimpleSet Which is not btt-Mitotic
UR - http://noad.sci.am/dlibra/docmetadata?id=135788
ER -