A Hierarchy of Immunity and Density for Sets of Reals

  • Takayuki Kihara
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7318)


The notion of immunity is useful to classify degrees of noncomputability. Meanwhile, the notion of immunity for topological spaces can be thought of as an opposite notion of density. Based on this viewpoint, we introduce a new degree-theoretic invariant called layer density which assigns a value n to each subset of Cantor space. Armed with this invariant, we shed light on an interaction between a hierarchy of density/immunity and a mechanism of type-two computability.




Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Binns, S.: Hyperimmunity in 2. Notre Dame Journal of Formal Logic 48(2), 293–316 (2007)MathSciNetMATHCrossRefGoogle Scholar
  2. 2.
    Brattka, V., Gherardi, G.: Effective choice and boundedness principles in computable analysis. Bulletin of Symbolic Logic 17(1), 73–117 (2011)MathSciNetMATHCrossRefGoogle Scholar
  3. 3.
    Brattka, V., Presser, G.: Computability on subsets of metric spaces. Theor. Comput. Sci. 305(1-3), 43–76 (2003)MathSciNetMATHCrossRefGoogle Scholar
  4. 4.
    Cenzer, D., Kihara, T., Weber, R., Wu, G.: Immunity and non-cupping for closed sets. Tbilisi Math. J. 2, 77–94 (2009)MathSciNetMATHGoogle Scholar
  5. 5.
    Demuth, O., Kučera, A.: Remarks on 1-genericity, semigenericity and related concepts. Comment. Math. Univ. Carolinae 28, 85–94 (1987)MATHGoogle Scholar
  6. 6.
    Higuchi, K., Kihara, T.: Inside the Muchnik degrees: Discontinuity, learnability, and constructivism (preprint)Google Scholar
  7. 7.
    Lewis, A.E.M., Shore, R.A., Sorbi, A.: Topological aspects of the Medvedev lattice. Arch. Math. Log. 50(3-4), 319–340 (2011)MathSciNetMATHCrossRefGoogle Scholar
  8. 8.
    Soare, R.I.: Recursively Enumerable Sets and Degrees. Perspectives in Mathematical Logic, xVIII+437 pages. Springer, Heidelberg (1987)Google Scholar
  9. 9.
    Weihrauch, K.: Computable Analysis: An Introduction. Texts in Theoretical Computer Science, 285 pages. Springer (2000)Google Scholar
  10. 10.
    Ziegler, M.: Real computation with least discrete advice: A complexity theory of nonuniform computability with applications to effective linear algebra. Annals of Pure and Applied Logic 163(8), 1108–1139 (2012), http://www.sciencedirect.com/science/article/pii/S016800721100203X

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Takayuki Kihara
    • 1
  1. 1.Mathematical InstituteTohoku UniversitySendaiJapan

Personalised recommendations