Relationships between different forms of relative computability of functions

This article studies connections between several enumeration reducibility relations (including reducibility relationships defined by recursive and $\mu$-recursive operators) on the set of all partial functions of one variable. Isomorphic embeddings between the semilattices of the corresponding degrees are established. In passing, a strengthening of the fundamental operator theorem is obtained.
Figures: 3.
Bibliography: 11 titles.