Skip to main content

Superbranching degrees

Part of the Lecture Notes in Mathematics book series (LNM,volume 1432)

Keywords

  • Lower Priority
  • Apply Logic
  • Process Number
  • Minimal Pair
  • Expansionary Stage

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.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
Price excludes VAT (Canada)
  • 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Downey, R.G., A contiguous nonbranching degree, Z. Math. Logik. Grund. Math. (to appear).

    Google Scholar 

  2. Downey, R.G., Notes on the 0‴ priority method with special attention to density arguments, these proceedings.

    Google Scholar 

  3. Downey, R.G and T. Slaman, Completely mitotic r.e. degrees, Annals Pure and Applied Logic 41 (1989) 119–152.

    CrossRef  MathSciNet  MATH  Google Scholar 

  4. Fejer, P., On the Structure of Definable Subclasses of the Recursively Enumerable Degrees, Ph.D. Diss., University of Chicago, 1980.

    Google Scholar 

  5. Fejer, P., Branching degrees above low degrees, Trans. Amer. Math. Soc. 273 (1982) 157–180.

    CrossRef  MathSciNet  MATH  Google Scholar 

  6. Fejer, P., The density of the nonbranching degrees, Ann. Pure and Applied Logic 24 (1983) 113–130.

    CrossRef  MathSciNet  MATH  Google Scholar 

  7. Lachlan, A.H., Lower bounds for pairs of recursively enumerable degrees, Proc. London Math. Soc. 16 (1966) 537–569.

    CrossRef  MathSciNet  MATH  Google Scholar 

  8. Lachlan, A.H., Bounding minimal pairs, J. Symb. Logic 44 (1979) 626–642.

    CrossRef  MathSciNet  MATH  Google Scholar 

  9. Lachlan, A.H., Decomposition of recursively enumerable degrees, Proc. Amer. Math. Soc. 79 (1980) 629–634.

    CrossRef  MathSciNet  MATH  Google Scholar 

  10. Shoenfield, J., Applications of model theory to degrees of unsolvability, in Symposium on the Theory of Models (ed. Addison, Henkin, and Tarski), North-Holland Amsterdam (1966) 359–363.

    Google Scholar 

  11. Slaman, T., The recursively Enumerable Branching Degrees are Dense in the Recursively Enumerable Degrees, handwritten notes, Univ. of Chicago (1980).

    Google Scholar 

  12. Soare, R.I., Recursively Enumerable Sets and Degrees, Springer-Verlag, New York 1987.

    CrossRef  MATH  Google Scholar 

  13. Yates, C.E.M., A minimal pair of recursively enumerable degrees, J.Symbolic Logic, 31 (1966) 159–168.

    CrossRef  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1990 Springer-Verlag

About this paper

Cite this paper

Downey, R., Mourad, J. (1990). Superbranching degrees. In: Ambos-Spies, K., Müller, G.H., Sacks, G.E. (eds) Recursion Theory Week. Lecture Notes in Mathematics, vol 1432. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0086117

Download citation

  • DOI: https://doi.org/10.1007/BFb0086117

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52772-5

  • Online ISBN: 978-3-540-47142-4

  • eBook Packages: Springer Book Archive