On decomposition of the \(0'\) degree into lesser \(T\)-degrees containing differences of recursively enumerable sets (Q1897906)

First I would like to notice that the term ``decomposition'' in the English translation of the title is not completely accurate, because in recursion theory the term ``splitting'' is more general in use. The differences of recursively enumerable (r.e.) sets (briefly, d.r.e. sets) and their degrees are by their properties very close to r.e. sets and degrees. But there are some important differences between them. One of these differences is the non-density of d.r.e. degrees, proved by S. B. Cooper, L. Harrington, A. H. Lachlan, S. Lempp, R. I. Soare. Another difference was found by the author who proves that the degree \(0'\), which is maximal in both the classes of r.e. and d.r.e. degrees, is splittable over any incomplete r.e. degree in the d.r.e. degrees (the impossibility of such a splitting in the r.e. degrees was obtained by A. H. Lachlan (1976) using his famous `monstrous injury' argument).