Skip to main content

On Splits of Computably Enumerable Sets

  • Chapter
  • First Online:
Computability and Complexity

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

  • 1088 Accesses

Abstract

Our focus will be on the computably enumerable (c.e.) sets and trivial, non-trivial, Friedberg, and non-Friedberg splits of the c.e. sets. Every non-computable set has a non-trivial Friedberg split. Moreover, this theorem is uniform. V. Yu. Shavrukov recently answered the question which c.e. sets have a non-trivial non-Friedberg splitting and we provide a different proof of his result. We end by showing there is no uniform splitting of all c.e. sets such that all non-computable sets are non-trivially split and, in addition, all sets with a non-trivial non-Friedberg split are split accordingly.

Draft as of August 7, 2016. We want to thank V. Yu. Shavrukov for allowing us to include his result, Theorem 3.8. Without it, this paper would look very different. This research was started while Cholak participated in the Buenos Aires Semester in Computability, Complexity and Randomness, 2013. Thanks to Rachel Epstein, Greg Igusa, Nathan Pierson, Mike Stob, and the referees for comments and suggestions. My interest in Friedberg splits was sparked in 1989 by Rod Downey. I cannot forgive him.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    The Herrmann and Kummer Splitting Theorem appears, in a very different form, in Herrmann and Kummer [7]. This theorem appears in the only if direction of the proof of Theorem 2.4 of Herrmann and Kummer [7] starting on page 63 from the first full paragraph on that page. It is interesting enough to be isolated in its own right as a theorem.

References

  1. Cholak, P.: Some recent research directions in the computably enumerable sets. To appear in the book “The Incomputable” in the Springer/CiE book series (2013)

    Google Scholar 

  2. Cholak, P., Downey, R., Herrmann, E.: Some orbits for \(\cal{E}\). Ann. Pure Appl. Log. 107(1–3), 193–226 (2001). doi:10.1016/S0168-0072(00)00060-9. ISSN: 0168–0072

    Article  MathSciNet  MATH  Google Scholar 

  3. Cholak, P.A., Gerdes, P., Lange, K.: \(\cal{D}\)-maximal sets. J. Symb. Log. 80(4), 1182–1210 (2015). The Url is to the first unpublished version of this paper. The first and last citation of this paper are actually to this version. arxiv:1401.1266v1. ISSN: 0022–4812

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  5. Friedberg, R.M.: Three theorems on recursive enumerationI. I. Decomposition. II. Maximal set. III. Enumeration without duplication. J. Symb. Logic 23, 309–316 (1958). ISSN: 0022–4812

    Article  MathSciNet  MATH  Google Scholar 

  6. Hammond, T.: Friedberg splittings in \(\Sigma ^0_3\) quotient lattices of \(\cal{E}\). J. Symb. Log. 64(4), 1403–1406 (1999). doi:10.2307/2586786. ISSN: 0022–4812

    Article  MathSciNet  MATH  Google Scholar 

  7. Herrmann, E., Kummer, M.: Diagonals and \({\cal{D}}\)-maximal sets. J. Symb. Log. 59(1), 60–72 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  8. Kummer, M.: Diagonals and semihyperhypersimple sets. J. Symb. Log. 56(3), 1068–1074 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  9. Myhill, J.: Problems. J. Symb. Log. 21, 215 (1956). This question was the eighth problem appearing in this section

    Article  Google Scholar 

  10. Owings, J.C.: Recursion, metarecursion, and inclusion. J. Symb. Log. 32, 173–178 (1967)

    Article  MathSciNet  MATH  Google Scholar 

  11. Shavrukov, V.Y.: Friedberg splittings and \(\cal{D}\)-maximal sets. A letter from Shavrukov, V.Y., to Cholak, P. and Schmerl, J., 16 May 2015

    Google Scholar 

  12. Soare, R.I.: 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

Authors

Corresponding author

Correspondence to Peter A. Cholak .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this chapter

Cite this chapter

Cholak, P.A. (2017). On Splits of Computably Enumerable Sets. In: Day, A., Fellows, M., Greenberg, N., Khoussainov, B., Melnikov, A., Rosamond, F. (eds) Computability and Complexity. Lecture Notes in Computer Science(), vol 10010. Springer, Cham. https://doi.org/10.1007/978-3-319-50062-1_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-50062-1_31

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-50061-4

  • Online ISBN: 978-3-319-50062-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics