Skip to main content
SpringerLink
Log in

Lowness for genericity

  • Published:
Archive for Mathematical Logic Aims and scope Submit manuscript

Abstract

We study lowness for genericity. We show that there exists no Turing degree which is low for 1-genericity and all of computably traceable degrees are low for weak 1-genericity.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

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. Downey, R., Hirschfeldt, D.: Algorithmic Randomness and Complexity. Monographs in Computer Science, Springer-Verlag, In preparation

  2. Jockusch, C.: Degrees of generic sets. Recursion theory: its generalisation and applications (Proc. Logic Colloq., Univ. Leeds, Leeds, 1979), pp. 110–139, London Math. Soc. Lecture Note Ser., 45, Cambridge Univ. Press, Cambridge-New York 1980

  3. Jockusch, C., Shore, R.: Pseudojump operators. II. Transfinite iterations, hierarchies and minimal covers. J. Symbolic Logic 49 (4), 1205–1236 (1984)

    Google Scholar 

  4. Jockusch, C., Soare, R.: Π 01 classes and degrees of theories. Trans. Amer. Math. Soc. 173, 33–56 (1972)

    Google Scholar 

  5. Kurtz, S.: Randomness and Genericity in the Degrees of Unsolvability. PhD Diss., University of Illinois, Urbana 1981

  6. Martin-Löf, P.: The definition of random sequences. Information and Control, 9, 602-619 (1966)

    Google Scholar 

  7. Miller, W., Martin, D.: The degrees of hyperimmune sets. Z. Math. Logik Grundlagen Math. 14, 159–166 (1968)

    Google Scholar 

  8. Nies, A.: Lowness properties and randomness. To appear

  9. Nitzpon, D.: On low for. Doctoraal examens, University of Amsterdam, 2002

  10. Soare, R.: Recursively Enumerable Sets and Degrees. Springer–Verlag, Heidelberg, 1987

  11. Terwijn, S., Zambella, D.: Computational randomness and lowness. J. Symbolic Logic 66 (3), 1199–1205 (2001)

    Google Scholar 

  12. Van Lambalgen, M: Random Sequences. Ph.D. Diss. University of Amsterdam 1987

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, National University of Singapore 2, Science Drive 2, 117543, Singapore

    Liang Yu

Authors
  1. Liang Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Liang Yu.

Additional information

The author is supported by postdoctoral fellowship from the New Zealand Institute for Mathematics and its Applications, NSF of China No. 10471060.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yu, L. Lowness for genericity. Arch. Math. Logic 45, 233–238 (2006). https://doi.org/10.1007/s00153-005-0306-y

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00153-005-0306-y

Mathematics Subject Classification (2000)

Search

Navigation