Skip to main content
SpringerLink
Log in

Some Recent Research Directions in the Computably Enumerable Sets

  • Chapter
  • First Online:
The Incomputable

Part of the book series: Theory and Applications of Computability ((THEOAPPLCOM))

  • 1137 Accesses

Abstract

As suggested by the title, this paper is a survey of recent results and questions on the collection of computably enumerable sets under inclusion. This is not a broad survey but one focused on the author’s and a few others’ current research.

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 109.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 139.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 139.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. P. Cholak, Automorphisms of the lattice of recursively enumerable sets. Mem. Am. Math. Soc. 113 (541), viii+151 (1995). ISSN: 0065-9266

    Google Scholar 

  2. P. Cholak, L.A. Harrington, Definable encodings in the computably enumerable sets. Bull. Symb. Log. 6 (2), 185–196 (2000). ISSN: 1079-8986

    Google Scholar 

  3. P. Cholak, L.A. Harrington, Isomorphisms of splits of computably enumerable sets. J. Symb. Log. 68 (3), 1044–1064 (2003). ISSN: 0022-4812

    Google Scholar 

  4. P. Cholak, L.A. Harrington, Extension theorems, orbits, and automorphisms of the computably enumerable sets. Trans. Am. Math. Soc. 360 (4), 1759–1791 (2008). ISSN: 0002-9947, math.LO/0408279

    Google Scholar 

  5. P. Cholak, R. Downey, M. Stob, Automorphisms of the lattice of recursively enumerable sets: promptly simple sets. Trans. Am. Math. Soc. 332 (2), 555–570 (1992). ISSN: 0002-9947

    Google Scholar 

  6. P. Cholak, R. Downey, L.A. Harrington, The complexity of orbits of computably enumerable sets. Bull. Symb. Log. 14 (1), 69–87 (2008). ISSN: 1079-8986

    Google Scholar 

  7. P. Cholak, R. Downey, L.A. Harrington, On the orbits of computably enumerable sets. J. Am. Math. Soc. 21 (4), 1105–1135 (2008). ISSN: 0894-0347

    Google Scholar 

  8. P. Cholak, P.M. Gerdes, K. Lange, On n-tardy sets. Ann. Pure Appl. Log. 163 (9), 1252–1270 (2012). ISSN: 0168-0072, doi:10.1016/j.apal.2012.02.001. http://dx.doi.org/10.1016/j.apal.2012.02.001

  9. P. Cholak, P. Gerdes, K. Lange, The \(\mathcal{D}\)-maximal sets. J. Symbolic Logic 80 (4), 1182–1210 (2015). doi:10.1017/jsl.2015.3

    Article  MathSciNet  MATH  Google Scholar 

  10. R.G. Downey, M. Stob, Automorphisms of the lattice of recursively enumerable sets: orbits. Adv. Math. 92, 237–265 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  11. R. Downey, M. Stob, Splitting theorems in recursion theory. Ann. Pure Appl. Log. 65 (1), 106 pp. (1993). ISSN: 0168-0072

    Google Scholar 

  12. R.G. Downey, C.G. Jockusch Jr., P.E. Schupp, Asymptotic density and computably enumerable sets. arXiv.org, June 2013

    Google Scholar 

  13. R. Epstein, Invariance and automorphisms of the computably enumerable sets, Ph.D. thesis, University of Chicago, 2010

    Google Scholar 

  14. R. Epstein, The nonlow computably enumerable degrees are not invariant in \(\mathcal{E}\). Trans. Am. Math. Soc. 365 (3), 1305–1345 (2013). ISSN: 0002-9947, doi:10.1090/S0002-9947-2012-05600-5, http://dx.doi.org/10.1090/S0002-9947-2012-05600-5

  15. R.M. Friedberg, Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication. J. Symb. Log. 23, 309–316 (1958)

    MATH  Google Scholar 

  16. L.A. Harrington, R.I. Soare, Post’s program and incomplete recursively enumerable sets. Proc. Natl. Acad. Sci. U.S.A. 88, 10242–10246 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  17. L.A. Harrington, R.I. Soare, The \(\Delta _{3}^{0}\)-automorphism method and noninvariant classes of degrees. J. Am. Math. Soc. 9 (3), 617–666 (1996). ISSN: 0894-0347

    Google Scholar 

  18. L. Harrington, R.I. Soare, Codable sets and orbits of computably enumerable sets. J. Symb. Log. 63 (1), 1–28 (1998). ISSN: 0022-4812

    Google Scholar 

  19. E. Herrmann, M. Kummer, Diagonals and \(\mathcal{D}\)-maximal sets. J. Symb. Log. 59 (1), 60–72 (1994). ISSN: 0022-4812, doi:10.2307/2275249, http://dx.doi.org/10.2307/2275249

  20. S.C. Kleene, E.L. Post, The upper semi-lattice of degrees of recursive unsolvability. Ann. Math. (2) 59, 379–407 (1954)

    Google Scholar 

  21. A.H. Lachlan, Degrees of recursively enumerable sets which have no maximal supersets. J. Symb. Log. 33, 431–443 (1968)

    Article  MathSciNet  MATH  Google Scholar 

  22. W. Maass, Characterization of recursively enumerable sets with supersets effectively isomorphic to all recursively enumerable sets. Trans. Am. Math. Soc. 279, 311–336 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  23. D.A. Martin, Classes of recursively enumerable sets and degrees of unsolvability. Z. Math. Logik Grundlag. Math. 12, 295–310 (1966)

    Article  MathSciNet  MATH  Google Scholar 

  24. R.I. Soare, Automorphisms of the lattice of recursively enumerable sets I: maximal sets. Ann. Math. (2) 100, 80–120 (1974)

    Google Scholar 

  25. R.I. Soare, Automorphisms of the lattice of recursively enumerable sets II: low sets. Ann. Math. Log. 22, 69–107 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  26. R.I. Soare, Recursively Enumerable Sets and Degrees. Perspectives in Mathematical Logic, Omega Series (Springer, Heidelberg, 1987)

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Notre Dame, Notre Dame, IN, 46556-5683, USA

    Peter A. Cholak

Authors
  1. Peter A. Cholak
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Peter A. Cholak .

Editor information

Editors and Affiliations

  1. School of Mathematics, University of Leeds, Leeds, United Kingdom

    S. Barry Cooper

  2. Dept. of Mathematical Logic & Applications, Sofia University, Sofia, Bulgaria

    Mariya I. Soskova

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this chapter

Cite this chapter

Cholak, P.A. (2017). Some Recent Research Directions in the Computably Enumerable Sets. In: Cooper, S., Soskova, M. (eds) The Incomputable. Theory and Applications of Computability. Springer, Cham. https://doi.org/10.1007/978-3-319-43669-2_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-43669-2_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-43667-8

  • Online ISBN: 978-3-319-43669-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation