On a problem of Ishmukhametov

DOI10.1007/S00153-013-0340-0zbMATH Open1298.03101OpenAlexW2054256856MaRDI QIDQ377474FDOQ377474

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

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

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)

Cites Work

• On the r. e. predecessors of d. r. e. degrees
• On relative enumerability of Turing 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
• Nonexistence of Minimal Pairs in $$L[{\mathbf d}]$$
• A Survey of Results on the d-c.e. and n-c.e. Degrees

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)