Embedding of countable orders in Turing degrees

DOI10.1023/A:1021400820931zbMATH Open1025.03033OpenAlexW61235908MaRDI QIDQ1810239FDOQ1810239

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

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

zbMATH Keywords

latticeorderingembedding methodTuring degreesrecursive function

Mathematics Subject Classification ID

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

Cited In (3)

• Embedding countable partial orderings in the enumeration degrees and the \(\omega \)-enumeration degrees
• Title not available (Why is that?)
• Title not available (Why is that?)

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)