On a problem of Ishmukhametov

DOI10.1007/S00153-013-0340-0MaRDI QIDQ377474zbMATH OpenOpenAlexFDO

Authors Chengling Fang, Guohua Wu, M. M. Yamaleev

Publication date 6 November 2013

Published in Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00153-013-0340-0

zbMATH Keywords

d.c.e. degreesLachlan setsTuring degrees

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other Turing degree structures (03D28) Other degrees and reducibilities in computability and recursion theory (03D30)

Recommendations

• Nonexistence of Minimal Pairs in $$L[{\mathbf d}]$$
• Isolation and the high/low hierarchy
• Isolation in the d.c.e. degrees
• A decomposition of the Rogers semilattice of a family of d.c.e. sets
• There are no maximal low d.c.e. degrees

Cites work

• On relative enumerability of Turing degrees
• On the r. e. predecessors of d. r. e. degrees
• Relative enumerability in the difference hierarchy

Cited in

(5)

• Downward density of exact degrees
• Elementary theories and structural properties of d-c.e. and n-c.e. degrees
• Turing computability: structural theory
• A survey of results on the d-c.e. and n-c.e. degrees
• Nonexistence of Minimal Pairs in $$L[{\mathbf d}]$$

This page was built for publication: On a problem of Ishmukhametov

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