Skip to main content
SpringerLink
Log in

A direct construction of a minimal recursively enumerable truth-table degree

  • Conference paper
  • First Online:
Recursion Theory Week

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

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 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 46.00
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. A. N. Degtev. tt-and m-degrees. Algebra and Logic, 12:78–89, 1973.

    Article  MathSciNet  MATH  Google Scholar 

  2. L. Harrington and C. A. Haught. Limitations on initial segment embeddings in the r.e. tt-degrees. To appear.

    Google Scholar 

  3. C. A. Haught and R. A. Shore. Undecidability and initial segments of the (r.e.) tt-degrees. To appear, Journal of Symbolic Logic.

    Google Scholar 

  4. C. A. Haught and R. A. Shore. Undecidability and initial segments of the wtt-degrees ≤0′. This Volume.

    Google Scholar 

  5. G. N. Kobzev. On tt-degrees of r.e. T-degrees. Mathematics of the USSR, Sbornik, 35:173–180, 1978.

    Article  MATH  Google Scholar 

  6. A. H. Lachlan. Initial segments of one-one degrees. Pacific Journal of Mathematics, 29:351–366, 1969.

    Article  MathSciNet  MATH  Google Scholar 

  7. A. H. Lachlan. Recursively enumerable many-one degrees. Algebra and Logic, 11:186–202, 1972.

    Article  MathSciNet  MATH  Google Scholar 

  8. R. E. Ladner and L. P. Sasso, Jr. The weak truth table degrees of recursively enumerable sets. Annals of Mathematical Logic, 8:429–448, 1975.

    Article  MathSciNet  MATH  Google Scholar 

  9. S. S. Marchenkov. The existence of recursively enumerable minimal truth-table degrees. Algebra and Logic, 14:257–261, 1975.

    Article  MathSciNet  Google Scholar 

  10. S. S. Marchenkov. On the comparison of the upper semilattices of recursively enumerable m-degrees and truth-table degrees. Mathematical Notes of the Academy of Sciences of the USSR, 20:567–570, 1976.

    Article  MathSciNet  Google Scholar 

  11. P. Odifreddi. Strong reducibilities. Bulletin (New Series) of the American Mathematical Society, 4:37–86, 1981.

    Article  MathSciNet  MATH  Google Scholar 

  12. P. Odifreddi. Classical Recursion Theory. Studies in Logic and the Foundations of Mathematics. North-Holland, Amsterdam, 1989.

    Google Scholar 

  13. D. B. Posner. A survey of non-r.e. degrees ≤ 0′. In F. R. Drake and S. S. Wainer, editors, Recursion Theory: Its Generalizations and Applications, Proceedings of Logic Colloquium '79, Leed, August 1979. London Mathematical Society Lecture Note Series, Volume 45, pages 52–109, Cambridge, 1980. Cambridge University Press.

    Chapter  Google Scholar 

  14. H. Rogers, Jr. Theory of Recursive Functions and Effective Computability. MIT Press, Cambridge, 1987.

    MATH  Google Scholar 

  15. G. E. Sacks. A minimal degree less than 0′. Bulletin of the American Mathematical Society, 67:416–419, 1961.

    Article  MathSciNet  MATH  Google Scholar 

  16. G. E. Sacks. The recursively enumerable degrees are dense. Annals of Mathematics (2), 80:300–312, 1964.

    Article  MathSciNet  MATH  Google Scholar 

  17. J. R. Shoenfield. A theorem on minimal degrees. Journal of Symbolic Logic, 31:539–544, 1966.

    Article  MathSciNet  MATH  Google Scholar 

  18. R. I. Soare. Recursively Enumerable Sets and Degrees: The Study of Computable Functions and Computably Generated Sets. Perspectives in Mathematical Logic, Θ-Series. Springer-Verlag, Berlin, 1987.

    Google Scholar 

  19. C. Spector. On degrees of recursive unsolvability. Annals of Mathematics (2), 64:581–592, 1956.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, University of Massachusetts at Boston, 02125, Boston, MA, USA

    Peter A. Fejer

  2. Department of Mathematics, Cornell University, 14853, Ithaca, NY, USA

    Richard A. Shore

  3. MSRI, 1000 Centennial Drive, 94720, Berkeley, CA, USA

    Richard A. Shore

Authors
  1. Peter A. Fejer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Richard A. Shore
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Klaus Ambos-Spies Gert H. Müller Gerald E. Sacks

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag

About this paper

Cite this paper

Fejer, P.A., Shore, R.A. (1990). A direct construction of a minimal recursively enumerable truth-table degree. 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/BFb0086118

Download citation

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

  • 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

Publish with us

Policies and ethics

Search

Navigation