Initial Segments of Many-One Degrees

DOI10.4153/CJM-1970-010-6MaRDI QIDQ5636864zbMATH OpenFDO

Authors Alistair H. Lachlan

Publication date 1970

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

Full work available at URL https://doi.org/10.4153/CJM-1970-010-6

Mathematics Subject Classification ID

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

Cited in

(14)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5636864)