Skip to main content
Log in

On a problem of Ishmukhametov

  • Published:
Archive for Mathematical Logic Aims and scope Submit manuscript

Abstract

Given a d.c.e. degree d, consider the d.c.e. sets in d and the corresponding degrees of their Lachlan sets. Ishmukhametov provided a systematic investigation of such degrees, and proved that for a given d.c.e. degree d > 0, the class of its c.e. predecessors in which d is c.e., denoted as R[d], can consist of either just one element, or an interval of c.e. degrees. After this, Ishmukhametov asked whether there exists a d.c.e. degree d for which the class R[d] has no minimal element. We give a positive answer to this question.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Arslanov M., LaForte G., Slaman T.: Relative enumerability in the difference hierarchy. J. Symb. Logic 63, 411–420 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  2. Ishmukhametov S.: On the r.e. predecessors of d.r.e. degrees. Arch. Math. Logic 38, 373–386 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  3. Ishmukhametov, S.: On relative enumerability of Turing degrees. Arch. Math. Logic 39, 145–154 (2000)

    Google Scholar 

  4. Soare, R.: Recursively Enumerable Sets and Degrees. Perspectives in Mathematical Logic, Omega Series. Springer. Heidelberg (1987)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Guohua Wu.

Additional information

Fang is supported by Chongqing Jiaotong University Fund (No. 2012kjc2-018).

Wu is supported in part by NTU grant RG37/09, M52110101 and grant MOE2011-T2-1-071 from Ministry of Education of Singapore.

Yamaleev is supported by NTU grant RG37/09, M52110101, by Russian Foundation for Basic Research (projects RFBR-12-01-97008, RFBR-12-01-31389), by The President grant of Russian Federation (project SS-5383.2012.1), and by The Ministry of education and science of Russian Federation (projects 14.A18.21.0360, 14.A18.21.0368, 14.A18.21.1127).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fang, C., Wu, G. & Yamaleev, M. On a problem of Ishmukhametov. Arch. Math. Logic 52, 733–741 (2013). https://doi.org/10.1007/s00153-013-0340-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00153-013-0340-0

Keywords

Navigation