Abstract:
A new reducibility (the so-called apm-reducibility) of enumeration type, which is weaker than the pm-reducibility is introduced in this paper. Some important properties of this new reducibility are proved here.
Keywords:computability, enumeration reducibility, enumeration degrees, almost partial m-reducibility.
Fulltext:
PDF file (242 kB)