We consider the properties of computably enumerable (c.e.) Turing degrees containing sets, which possess the property of a T-mitotic splitting but don't have a wtt-mitotic splitting. It is proved that for any noncomputable c.e. degree b there exists a degree a, such that a · b and a contains a simple T- itotic set, which is not wtt-mitotic.
oai:noad.sci.am:136240
Mathematical Problems of Computer Science
Institute for Informatics and Automation Problems of NAS RA
May 6, 2021
May 6, 2021
21
https://noad.sci.am/publication/149805
Հրատարակության անուն | Ամսաթիվ |
---|---|
Mokatsian Arsen H., On Initial Segments of Turing Degrees Containing Simple T-Mitotic but not wtt-Mitotic Sets | May 6, 2021 |
Mokatsian Arsen H.