Complexity of Decompositions of Gödel Numberings

It is shown that each Gödel numbering is effective sum of infinitely many pairwise incomparable Friedberg numberings, the complexity of which set of Friedberg numberings can be of any ordinal type.

Перевод пока недоступен