Embedding of countable orders in Turing degrees

DOI10.1023/A:1021400820931MaRDI QIDQ1810239zbMATH OpenOpenAlexFDO

Authors Sh. T. Ishmukhametov

Publication date 15 June 2003

Published in Mathematical Notes (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1021400820931

zbMATH Keywords

latticeorderingembedding methodTuring degreesrecursive function

Mathematics Subject Classification ID

Other Turing degree structures (03D28) Recursive functions and relations, subrecursive hierarchies (03D20)

Recommendations

• Embeddings into the Turing degrees
• Embedding countable partial orderings in the enumeration degrees and the \(\omega \)-enumeration degrees
• A note on initial segments of the enumeration degrees
• Embeddings in the Strong Reducibilities Between 1 and npm
• Jump embeddings in the Turing degrees

Cited in

(3)

• Embedding countable partial orderings in the enumeration degrees and the \(\omega \)-enumeration degrees
• scientific article; zbMATH DE number 4134028 (Why is no real title available?)
• scientific article; zbMATH DE number 1531929 (Why is no real title available?)

This page was built for publication: Embedding of countable orders in Turing degrees

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