Skip to main content
SpringerLink
Log in

Structures of Some Strong Reducibilities

  • Conference paper
Mathematical Theory and Computational Practice (CiE 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5635))

Included in the following conference series:

Abstract

Recent developments in computability theory have given rise to new tools, among them the ibT and cl reducibilities, which, applications aside, are somewhat mysterious and deserve to be studied per se. This paper aims to throw some light on the little-explored degree structures induced by these new reducibilities.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barmpalias, G.: Computably enumerable sets in the solovay and the strong weak truth table degrees. In: Cooper, S.B., Löwe, B., Torenvliet, L. (eds.) CiE 2005. LNCS, vol. 3526, pp. 8–17. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  2. Barmpalias, G., Lewis, A.E.M.: The ibT degrees of computably enumerable sets are not dense. Ann. Pure Appl. Logic 141(1-2), 51–60 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  3. Downey, R., Hirschfeldt, D.R.: Algorithmic Randomness and Complexity. Unpublished monograph

    Google Scholar 

  4. Downey, R.G., Hirschfeldt, D.R., LaForte, G.: Randomness and reducibility. J. Comput. System Sci. 68(1), 96–114 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  5. Lewis, A.E.M., Barmpalias, G.: Randomness and the linear degrees of computability. Ann. Pure Appl. Logic 145(3), 252–257 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  6. Shoenfield, J.R.: On degrees of unsolvability. Ann. of Math. 69(3), 644–653 (1959)

    Article  MathSciNet  MATH  Google Scholar 

  7. Soare, R.I.: Computability Theory and Applications. Unpublished monograph

    Google Scholar 

  8. Soare, R.I.: Computability theory and differential geometry. Bull. Symbolic Logic 10(4), 457–486 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  9. Spector, C.: On degrees of recursive unsolvability. Ann. of Math. 64(2), 581–592 (1956)

    Article  MathSciNet  MATH  Google Scholar 

  10. van Lambalgen, M.: Random sequences. PhD thesis, University of Amsterdam (1987)

    Google Scholar 

  11. Yu, L., Ding, D.: There is no SW-complete c.e. real. J. Symbolic Logic 69(4), 1163–1170 (2004)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Waterloo, Waterloo, Ontario, N2L 3G1, Canada

    David R. Bélanger

Authors
  1. David R. Bélanger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Heidelberg, Im Neuenheimer Feld 294, 69120, Heidelberg, Germany

    Klaus Ambos-Spies

  2. Universiteit van Amsterdam, Plantage Muidergracht 24, 1018, Amsterdam, TV, The Netherlands

    Benedikt Löwe

  3. Institut für Informatik, Ruprecht-Karls-Universität Heidelberg, Im Neuenheimer Feld 294, 69120, Heidelberg, Germany

    Wolfgang Merkle

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bélanger, D.R. (2009). Structures of Some Strong Reducibilities. In: Ambos-Spies, K., Löwe, B., Merkle, W. (eds) Mathematical Theory and Computational Practice. CiE 2009. Lecture Notes in Computer Science, vol 5635. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03073-4_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03073-4_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03072-7

  • Online ISBN: 978-3-642-03073-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation