Advertisement

Totally < ωω Computably Enumerable and m-topped Degrees

  • Rod Downey
  • Noam Greenberg
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3959)

Abstract

In this paper we will discuss recent work of the authors (Downey, Greenberg and Weber [8] and Downey and Greenberg [6, 7]) devoted to understanding some new naturally definable degree classes which capture the dynamics of various natural constructions arising from disparate areas of classical computability theory.

It is quite rare in computability theory to find a single class of degrees which capture precisely the underlying dynamics of a wide class of apparently similar constructions, demonstrating that they all give the same class of degrees. A good example of this phenomenon is work pioneered by Martin [22] who identified the high c.e. degrees as the ones arising from dense simple, maximal, hh-simple and other similar kinds of c.e. sets constructions. Another example would be the example of the promptly simple degrees by Ambos-Spies, Jockusch, Shore and Soare [2]. Another more recent example of current great interest is the class of K-trivial reals of Downey, Hirscheldt, Nies and Stephan [5], and Nies [23, 24].

Keywords

Computable Function Computability Theory Computable Approximation Accessible Node Recursion Theory 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ambos-Spies, K., Fejer, P.: Embeddings of N5 and the contiguous degrees. Annals of Pure and Applied Logic 112, 151–188 (2001)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Ambos-Spies, K., Jockusch, C., Shore, R., Soare, R.: An algebraic decomposition of recursively enumerable degrees and the coincidence of several degree classes with the promptly simple degrees. Trans. Amer. Math. Soc. 281, 109–128 (1984)MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Downey, R.: Lattice nonembeddings and initial segments of the recursively enumerable degrees. Annals Pure and applied Logic 49, 97–119 (1990)MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Downey, R.: Some Computability-Theoretical Aspects of Reals and Randomness. In: Cholak, P. (ed.) The Notre Dame Lectures. Lecture Notes in Logic, vol. 18, pp. 97–148. Association for Symbolic Logic (2005)Google Scholar
  5. 5.
    Downey, R., Hirschfeldt, D., Nies, A., Stephan, F.: Trivial reals. extended abstract In: Brattka, V., Schröder, M., Weihrauch, K. (eds.) Computability and Complexity in Analysis Malaga, FernUniversität, July 2002. Electronic Notes in Theoretical Computer Science, and proceedings, 294–6/2002 pp. 37–55 (2002); Final version appears in Downey, R., Decheng, D., Ping, T.S. , Hui, Q.Y., Yasuugi, M., Wu, G. (eds.) Proceedings of the 7th and 8th Asian Logic Conferences, viii+471, pp. 103–131. World Scientific, Singapore (2003)Google Scholar
  6. 6.
    Downey, R., Greenberg, N.: Totally ω computably enumerable degrees II: Left c.e. reals (in preparation)Google Scholar
  7. 7.
    Downey, R., Greenberg, N.: Totally ωω-computably enumerable degrees I: lattice embeddings (in preparation) Google Scholar
  8. 8.
    Downey, R., Greenberg, N., Weber, R.: Totally ω computably enumerable degrees I: bounding critical triples (submitted) Google Scholar
  9. 9.
    Downey, R., Jockusch, C.: T-degrees, jump classes and strong reducibilities. Trans. Amer. Math. Soc. 301, 103–136 (1987)MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Downey, R., Jockusch, C., Stob, M.: Array nonrecursive sets and multiple permitting arguments. In: Ambos-Spies, K., Muller, G.H., Sacks, G.E. (eds.) Recursion Theory Week. Lecture Notes in Mathematics, vol. 1432, pp. 141–174. Springer, Heidelberg (1990)CrossRefGoogle Scholar
  11. 11.
    Downey, R., Jockusch, C., Stob, M.: Array nonrecursive degrees and genericity. In: Cooper, S.B., Slaman, T.A., Wainer, S.S. (eds.) Computability, Enumerability, Unsolvability. London Mathematical Society Lecture Notes Series, vol. 224, pp. 93–105. Cambridge University Press, Cambridge (1996)CrossRefGoogle Scholar
  12. 12.
    Downey, R., LaForte, G.: Presentations of computably enumerable reals. Theoretical Computer Science 284, 539–555 (2002)MATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Downey, R., Lempp, S.: Contiguity and distributivity in the enumerable degrees. Journal of Symbolic Logic 62, 1215–1240 (1997); Corrigendum in ibid 67, 1579–1580 (2002)Google Scholar
  14. 14.
    Downey, R., Shore, R.: Degree theoretical definitions of low2 recursively enumerable sets. J. Symbolic Logic 60, 727–756 (1995)MATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Downey, R., Shore, R.: Lattice embeddings below a non-low2 recursively enumerable degree. Israel Journal of Mathematics 94, 221–246 (1996)MATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Ishmukhametov, S.: Weak recursive degrees and a problem of Spector. In: Arslanov, M., Lempp, S. (eds.) Recursion Theory and Complexity, de Gruyter, Berlin, pp. 81–88 (1999)Google Scholar
  17. 17.
    Lachlan, A.: Embedding nondistributive lattices in the recursively enumerable degrees. In: Hodges, W. (ed.) Conference in Mathematical Logic, London 1970. Lecture notes in mathematics, vol. 255, pp. 149–177. Springer, Heidelberg (1972)CrossRefGoogle Scholar
  18. 18.
    Lachlan, A., Soare, R.: Not every finite lattice is embeddable in the recursively enumerable degrees. Advances in Math. 37, 78–82 (1980)CrossRefMathSciNetGoogle Scholar
  19. 19.
    Lempp, S., Lerman, M.: A finite lattice without critical triple that cannot be embedded into the computably enumerable Turing degrees. Annals of Pure and Applied Logic 87, 167–185 (1997)MATHCrossRefMathSciNetGoogle Scholar
  20. 20.
    Lempp, S., Lerman, M., Solomon, D.: Embedding finite lattices into the computably enumerable degrees - a status survey (to appear)Google Scholar
  21. 21.
    Lerman, M.: The embedding problem for the recursively enumerable degrees. In: Nerode, A., Shore, R. (eds.) Recursion Theory, pp. 13–20. American Math. Soc., Providence (1995)Google Scholar
  22. 22.
    Martin, D.: Classes of recursively enumerable sets and degrees of unsolvability. Z. Math. Logik Grundlag. Math. 12, 295–310 (1966)MATHCrossRefGoogle Scholar
  23. 23.
    Nies, A.: Reals which compute little. In: Proceedings of CL 2002 (2002) (to appear)Google Scholar
  24. 24.
    Nies, A.: Lowness properties and randomness. Advances in Mathematics 197(1), 274–305 (2005)MATHCrossRefMathSciNetGoogle Scholar
  25. 25.
    Nies, A., Shore, R., Slaman, T.: Interpretability and definability in the recursively enumerable degrees. Proc. Lon. Math. Soc. 3(77), 241–291 (1998)CrossRefMathSciNetGoogle Scholar
  26. 26.
    Schaeffer, B.: Dynamic notions of genericity and array noncomputability. Ann. Pure Appl. Logic. 95(1-3), 37–69 (1998)MATHCrossRefMathSciNetGoogle Scholar
  27. 27.
    Shore, R.: Natural definability in degree structures. In: Cholak, P., Lempp, S., Lerman, M., Shore, R.A. (eds.) Computability Theory and Its Applications: Current Trends and Open Problems. Contemporary Mathematics, pp. 255–272. AMS, Providence (2000)Google Scholar
  28. 28.
    Soare, R.: Recursively enumerable sets and degrees. Springer, Berlin (1987)Google Scholar
  29. 29.
    Walk, S.: Towards a definitioon of the array computable degrees, PH. D. Thesis, University of Notre Dame (1999)Google Scholar
  30. 30.
    Weinstein, S.: Ph. D. Thesis, University of California, Berkeley (1988)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Rod Downey
    • 1
  • Noam Greenberg
    • 1
  1. 1.School of Mathematics, Statistics, and Computer ScienceVictoria UniversityWellingtonNew Zealand

Personalised recommendations