Skip to main content
Log in

Spectrum of the Field of Computable Real Numbers

  • Published:
Algebra and Logic Aims and scope

Necessary and sufficient conditions for a Turing degree to be an element of the spectrum of the classical field of computable real numbers are established.

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. Yu. L. Ershov, Numeration Theory [in Russian], Nauka, Moscow (1977).

  2. S. S. Goncharov and Yu. L. Ershov, Constructive Models, Sib. School Alg. Log. [in Russian], Nauch. Kniga, Novosibirsk (1999).

  3. C. J. Ash and J. F. Knight, Computable Structures and the Hyperarithmetical Hierarchy, Stud. Log. Found. Math., 144, Elsevier, Amsterdam (2000).

  4. G. S. Tsejtin, “Mean value theorems in constructive analysis,” Am. Math. Soc., Translat., II. Ser., 98, 11-40 (1971).

  5. P. Martin-Löf, Notes on Constructive Mathematics, Almqvist and Wiksell, Stockholm (1971).

  6. V. Brattka, “Computable versions of Baire’s category theorem,” in Mathematical Foundations of Computer Science, J. Sgall et al. (Eds.), Lect. Notes Comput. Sci., 2136, Springer, Berlin, (2001), pp. 224-235.

  7. A. Frolov, I. Kalimullin, V. Harizanov, O. Kudinov, and R. Miller, “Spectra of high n and non-low n degrees,” J. Log. Comput., 22, No. 4, 755-777 (2012).

    Article  MathSciNet  MATH  Google Scholar 

  8. H. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York (1967).

    MATH  Google Scholar 

  9. K. Weihrauch, Computable Analysis. An Introduction, Texts Theoret. Comput. Sci. EATCS Ser., Springer-Verlag, Berlin (2000).

  10. H. G. Rice, “Recursive real numbers,” Proc. Am. Math. Soc., 5, No. 5, 784-791 (1954).

  11. D. A. Martin, “Classes of recursively enumerated sets and degrees of unsolvability,” Z. Math. Log. Grund. Math., 12, No. 4, 295-310 (1966).

    Article  MATH  Google Scholar 

  12. J. R. Shoenfield, Degrees of Unsolvability, North-Holland Math. Stud., 2, Elsevier, New York (1971).

  13. C. G. Jockusch, Jr., “Degrees in which the recursive sets are uniformly recursive,” Can. J. Math., 24, 1092-1099 (1972).

    Article  MathSciNet  MATH  Google Scholar 

  14. A. Robinson, Introduction to Model Theory and to the Metamathematics of Algebra, North Holland, Amsterdam (1963).

    MATH  Google Scholar 

  15. J. Bochnak, M. Coste, and M.-F. Roy, Real Algebraic Geometry, Springer-Verlag, Berlin (1998).

    Book  MATH  Google Scholar 

  16. A. Fröhlich and J. Shepherdson, “Effective procedures in field theory,” Philos. Trans. Roy. Soc. London, Ser. A, 248, 407-432 (1956).

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to M. V. Korovina.

Additional information

(M. V. Korovina, O. V. Kudinov) Supported by RFBR (project No. 14-01-00376) and by DFG/RFBR joint grant CAVER BE 1267/14-1 and 14-01-91334.

Translated from Algebra i Logika, Vol. 55, No. 6, pp. 738-759, November-December, 2016.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Korovina, M.V., Kudinov, O.V. Spectrum of the Field of Computable Real Numbers. Algebra Logic 55, 485–500 (2017). https://doi.org/10.1007/s10469-017-9419-8

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10469-017-9419-8

Keywords

Navigation