Embedding of countable orders in Turing degrees

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

Shamil 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

latticeorderingrecursive functionembedding methodTuring degrees

Mathematics Subject Classification ID

Could not fetch data.

Related Items (2)

Embedding countable partial orderings in the enumeration degrees and the  -enumeration degrees ⋮ 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)