Initial Segments of Many-One Degrees

DOI10.4153/CJM-1970-010-6zbMath0229.02036MaRDI QIDQ5636864

Alistair H. Lachlan

Publication date: 1970

Published in: Canadian Journal of Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (14)

The structure of the honest polynomial m-degrees ⋮ Partial ordering of degrees of alternative m-reducibility ⋮ Undecidable fragments of elementary theories ⋮ Where join preservation fails in the bounded Turing degrees of c.e. sets ⋮ Positive equivalences ⋮ Structure of the upper semilattice of recursively enumerable m-degrees and related questions. I ⋮ Construction of the m-jump ⋮ Embeddings in the Strong Reducibilities Between 1 and npm ⋮ Two theorems on many-one degrees of recursively enumerable sets ⋮ The upper semilattice of numerations of a finite set ⋮ Undecidability and initial segments of the (r.e.) tt-degrees ⋮ Structure of the semilattice of tt1-degrees ⋮ The upper semilattice of numerations ⋮ Strong reducibilities

This page was built for publication: Initial Segments of Many-One Degrees