On a problem of Ishmukhametov

DOI10.1007/s00153-013-0340-0zbMath1298.03101OpenAlexW2054256856MaRDI QIDQ377474

Guohua Wu, Chengling Fang, 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 degrees and reducibilities in computability and recursion theory (03D30) Other Turing degree structures (03D28)

Related Items (5)

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

Cites Work

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

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