Two theorems on many-one degrees of recursively enumerable sets

DOI10.1007/BF02219743zbMath0309.02046OpenAlexW2050955644MaRDI QIDQ1218853

Alistair H. Lachlan

Publication date: 1973

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02219743

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (3)

The structure of the honest polynomial m-degrees ⋮ INITIAL SEGMENTS OF THE DEGREES OF CEERS ⋮ Hierarchy of Computably Enumerable Degrees II

Cites Work

• Initial Segments of Many-One Degrees

This page was built for publication: Two theorems on many-one degrees of recursively enumerable sets