Archive for Mathematical Logic

, Volume 48, Issue 7, pp 691–703 | Cite as

Infinite time extensions of Kleene’s \({\mathcal{O}}\)

Open Access
Article

Abstract

Using infinite time Turing machines we define two successive extensions of Kleene’s \({\mathcal{O}}\) and characterize both their height and their complexity. Specifically, we first prove that the one extension—which we will call \({\mathcal{O}^{+}}\)—has height equal to the supremum of the writable ordinals, and that the other extension—which we will call \({\mathcal{O}}^{++}\)—has height equal to the supremum of the eventually writable ordinals. Next we prove that \({\mathcal{O}^+}\) is Turing computably isomorphic to the halting problem of infinite time Turing computability, and that \({\mathcal{O}^{++}}\) is Turing computably isomorphic to the halting problem of eventual computability.

Keywords

Infinite time Turing machines Ordinal notation systems 

Mathematics Subject Classification (2000)

03D10 03D70 03F15 

Notes

Acknowledgments

The results presented in this paper are taken from the author’s MSc thesis [6]. The author wishes to express his sincerest thanks to Joel David Hamkins for very kind and helpful supervision.

Open Access

This article is distributed under the terms of the Creative Commons Attribution Noncommercial License which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.

References

  1. 1.
    Burgess J.P.: The truth is never simple. J. Symb. Log. 51, 663–681 (1986)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Hamkins J.D., Lewis A.: Infinite time Turing machines. J. Symb. Log. 65, 567–604 (2000)MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Hamkins J.D., Lewis A.: Post’s problem for supertasks has both positive and negative solutions. Arch. Math. Log. 41, 507–523 (2002)MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Kleene S.C.: On notation for ordinal numbers. J. Symb. Log. 3, 150–155 (1938)MATHCrossRefGoogle Scholar
  5. 5.
    Kleene S.C.: On the forms of predicates in the theory of constructive ordinals (second paper). Am. J. Math. 77, 405–428 (1955)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Klev, A.M.: Extending Kleene’s O using infinite time Turing machines. Master’s thesis, Universiteit van Amsterdam (2007)Google Scholar
  7. 7.
    Markwald W.: Zur Theorie der konstruktive Wohlordnungen. Math. Ann. 127, 135–140 (1954)MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Sacks G.E.: Higher Recursion Theory. Springer, Heidelberg (1990)MATHGoogle Scholar
  9. 9.
    Spector C.: Constructive well-orderings. J. Symb. Log. 20, 151–163 (1955)MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Spector, C.: Inductively defined sets of natural numbers. In: Infinitistic Methods, pp. 97–102. Pergamon Press, New York (1961)Google Scholar
  11. 11.
    Welch P.D.: Eventually infinite time degrees: infinite time decidable reals. J. Symb. Log. 65, 1193–1203 (2000)MATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Welch P.D.: The length of infinite time Turing machine computations. Bull. London Math. Soc. 32, 129–136 (2000)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© The Author(s) 2009

Authors and Affiliations

  1. 1.Department of PhilosophyMcGill UniversityMontréalCanada

Personalised recommendations