Lobachevskii Journal of Mathematics

, Volume 35, Issue 4, pp 295–301 | Cite as

Limitwise monotonic functions relative to the Kleene’s Ordinal Notation System

Article
  • 67 Downloads

Abstract

In this paper we generalize the theorem that previously obtained by the authors for a wider class of linear orders using X-limitwise monotonic functions relative to the Kleene’s Ordinal Notation System.

Keywords and phrases

Computable linear orders limitwise monotonic functions Ordinal Notations System 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    R. I. Soare, Recursively Enumerable Sets and Degrees (Springer, 1987).CrossRefGoogle Scholar
  2. 2.
    J. Rosenstein, Linear Orderings (Academic Press, New York, 1982).MATHGoogle Scholar
  3. 3.
    A. N. Frolov and M. V. Zubkov, Mathematical Logic Quarterly 55(6), 561 (2009).CrossRefMathSciNetGoogle Scholar
  4. 4.
    R. Downey, A. Kach, and D. Turetsky, Proceedings of the 11th Asian Logic Conference (World Sci. Publ., Hackensack, NJ, 2012), p. 59.Google Scholar
  5. 5.
    A. Church and S. C. Kleene, Fundamentae Mathematicae 28, 224 (1937).Google Scholar
  6. 6.
    A. Church, Bull. Amer.Math. Soc. 44, 224 (1938).CrossRefMathSciNetGoogle Scholar
  7. 7.
    S. C. Kleene, J. Symb. Logic 3, 150 (1938).CrossRefGoogle Scholar
  8. 8.
    H. Rogers, Theory of Recursive Functions and Effective Computability (Stevens, 1957).Google Scholar
  9. 9.
    M. M. Arslanov, Ershov’s Hierarhy (KSU, Kazan, 2007) [in Russian].Google Scholar

Copyright information

© Pleiades Publishing, Ltd. 2014

Authors and Affiliations

  1. 1.N.I. Lobachevskii Institute of Mathematics and MechanicsKazan (Volga Region) Federal UniversityKazanTatarstan, Russia

Personalised recommendations