Affiliation:
1. Institute for Informatics and Automation Problems of NAS RA
Abstract
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.
Publisher
Institute for Informatics and Automation Problems - NAS RA
Reference11 articles.
1. R. I. Soare, Recursively Enumerable Sets and Degrees, Springer-Verlag, 1987.
2. H. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill Book Company, 1967.
3. R. G. Downey and M. Stob, Splitting Theorems In Recursion Theory", Ann. Pure Appl. Logic, vol. 65, pp. 1-106, 1993.
4. A. H. Lachlan,The Priority Method. I, Zeitschrift fr mathematische Logik und Grundlagen der Mathematik, vol.1 3, pp. 1-10, 1967.
5. R.Ladner A complete mitotic recursively enumerable degree", Trans. Amer. Math. Soc., 184, pp. 497-507, 1973.