Skip to main content
SpringerLink
Log in

On arithmetical level of the class of superhigh sets

  • Published:
Russian Mathematics Aims and scope Submit manuscript

Abstract

We determine the proper arithmetical level of the class of superhigh sets.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. Mohrherr, “A Refinement of lown and highn for the R. E. Degrees,” Z. Math. Logik Grundlag. Math. 32(1), 5–12 (1986).

    Article  MATH  MathSciNet  Google Scholar 

  2. B. Kjos-Hanssen and A. Nies, “Superhighness,” Notre Dame J. Formal Logic 50(4), 445–452 (2009).

    Article  MATH  MathSciNet  Google Scholar 

  3. A. Nies, Computability and Randomness (Oxford University Press, 2009).

    Book  MATH  Google Scholar 

  4. N. L. Dobrinen and S. G. Simpson, “Almost Everywhere Domination,” J. Symbolic Logic 69(3), 914–922 (2004).

    Article  MATH  MathSciNet  Google Scholar 

  5. P. Cholak, R. Downey, and N. Greenberg, “Strong Jump-Traceabilty I: The Computably Enumerable Case,” Adv. Math. 217(5), 2045–2074 (2008).

    Article  MATH  MathSciNet  Google Scholar 

  6. S. Ishmukhametov, “Weak Recursive Degrees and a Problem of Spector,” in Proceedings of the Kazan’97 Workshop’ Recursion Theory and Complexity’, Kazan, 1997, Russia (Walter de Gruyter, Berlin, 81—87 (1999), pp. 81–87.

    Google Scholar 

  7. A. Nies, N. Greenberg, and D. Hirschfeldt, “Characterizing the Strongly Jump-Traceable Sets via Randomness,” Adv. Math. 231(3–4), 2252–2293 (2012).

    MATH  MathSciNet  Google Scholar 

  8. R. I. Soare, Computably Enumerable Sets and Degrees. A Study of Computable Functions and Computably Generated Sets (Springer-Verlag, Berlin etc., 1987; Kazansk. Matem. Ob-vo, Kazan, 2000) [Russ. transl.].

    Google Scholar 

  9. M. Kh. Faizrakhmanov, “A Semilattice Generated by Superlow Computably Enumerable Degrees,” Izv. Vyssh. Uchebn. Zaved.Mat., No. 1, 85–90 (2011) [Russian Mathematics (Iz. VUZ) 55 (1), 74–78 (2011)].

    Google Scholar 

  10. A. Nies, “Reals which Compute Little,” in Logic Colloquium 2002. Lecture Notes in Logic (La Jolla, CA, 2006), Vol. 27, pp. 260–274.

    Google Scholar 

  11. M. Kh. Faizrahmanov, “Computable Numberings of Families of Low Sets and Turing Jumps in the Ershov Hierarchy,” Sib. Mat. Zhurn. 51(6), 1435–1439 (2010).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Kazan (Volga Region) Federal University, ul. Kremlyovskaya 18, Kazan, 420008, Russia

    M. Kh. Faizrahmanov

Authors
  1. M. Kh. Faizrahmanov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. Kh. Faizrahmanov.

Additional information

Original Russian Text © M.Kh. Faizrahmanov, 2014, published in Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 2014, No. 5, pp. 53–58.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Faizrahmanov, M.K. On arithmetical level of the class of superhigh sets. Russ Math. 58, 43–47 (2014). https://doi.org/10.3103/S1066369X14050053

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S1066369X14050053

Keywords

Search

Navigation