An Application of 1-Genericity in the \(\Pi^0_2\) Enumeration Degrees

  • Liliana Badillo
  • Charles M. Harris
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7287)

Abstract

Using results from the local structure of the enumeration degrees we show the existence of prime ideals of Open image in new window enumeration degrees. We begin by showing that there exists a 1-generic enumeration degree Open image in new window which is noncuppable—and so properly downwards \(\Sigma^0_2\)—and low2. The notion of enumeration 1-genericity appropriate to positive reducibilities is introduced and a set A is defined to be symmetric enumeration 1-generic if both A and \(\ensuremath{\overline{A}} \) are enumeration 1-generic. We show that, if a set is 1-generic then it is symmetric enumeration 1-generic, and we prove that for any Open image in new window enumeration 1-generic set B the class \(\{\, X \,\mid \, \;\ensuremath{\negmedspace\leq_{\ensuremath{\mathrm{e}} }\negmedspace}\; B \,\}\) is uniform Open image in new window . Thus, picking 1-generic Open image in new window (from above) and defining Open image in new window it follows that every Open image in new window only contains Open image in new window sets. Since Open image in new window is properly \(\Sigma^0_2\) we deduce that Open image in new window contains no \(\Delta^0_2\) sets and so is itself properly Open image in new window .

Keywords

Induction Hypothesis Prime Ideal Minimal Pair Enumeration Degree Positive Reducibility 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [CO88]
    Copestake, C.S.: 1-generic enumeration degrees below \({{\rm \bf 0}\sb e'}\). Mathematical logic. In: Proc. Summer Sch. Conf. Ded. 90th Anniv. Arend Heyting, Chaika/Bulg, pp. 257–265 (1988, 1990)Google Scholar
  2. [CM85]
    Cooper, S.B., McEvoy, K.: On minimal pairs of enumeration degrees. Journal of Symbolic Logic 50(4), 983–1001 (1985)MathSciNetMATHCrossRefGoogle Scholar
  3. [CSY96]
    Cooper, S.B., Sorbi, A., Yi, X.: Cupping and noncupping in the enumeration degrees of \(\sigma^0_2\) sets. Annals of Pure and Applied Logic 82, 317–342 (1996)MathSciNetMATHCrossRefGoogle Scholar
  4. [CLSY05]
    Cooper, S.B., Li, A., Sorbi, A., Yang, Y.: Bounding and nonbounding minimal pairs in the enumeration degrees. Journal of Symbolic Logic 70(3), 741–766 (2005)MathSciNetMATHCrossRefGoogle Scholar
  5. [FR59]
    Friedberg, R.M., Rogers, H.: Reducibilities and completeness for sets of integers. Zeit. Math. Log. Grund. Math. 5, 117–125 (1959)MathSciNetMATHCrossRefGoogle Scholar
  6. [Gri03]
    Griffith, E.J.: Limit lemmas and jump inversion in the enumeration degrees. Archive for Mathematical Logic 42, 553–562 (2003)MathSciNetCrossRefGoogle Scholar
  7. [Har10]
    Harris, C.M.: Goodness in the enumeration and singleton degrees. Archive for Mathematical Logic 49(6), 673–691 (2010)MathSciNetMATHCrossRefGoogle Scholar
  8. [Har11]
    Harris, C.M.: Noncuppable enumeration degrees via finite injury. Journal of Logic and Computation (2011), doi:10.1093/logcom/exq044Google Scholar
  9. [Joc68]
    Jockusch, C.G.: Semirecursive sets and positive reducibility. Trans. Amer. Math. Soc. 131, 420–436 (1968)MathSciNetMATHCrossRefGoogle Scholar
  10. [LS92]
    Lachlan, H., Shore, R.A.: The n-rea enumeration degrees are dense. Archive for Mathematical Logic 31, 277–285 (1992)MathSciNetMATHCrossRefGoogle Scholar
  11. [Sos07]
    Soskova, M.I.: Genericity and Nonbounding. Journal of Logic and Computation 17, 1235–1255 (2007)MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Liliana Badillo
    • 1
  • Charles M. Harris
    • 1
  1. 1.Department of MathematicsLeedsUK

Personalised recommendations