Complexity of Decompositions of Gödel Numberings

Abstract

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.

Identifiers

DOI

10.3233/fi-1982-5103

Citations and references