Cupping and Noncupping in the Enumeration Degrees of Sigma20 Sets

Abstract We prove the following three theorems on the enumeration degrees of ∑ 2 0 sets. Theorem A: There exists a nonzero noncuppable ∑ 2 0 enumeration degree. Theorem B: Every nonzero Δ 2 0 enumeration degree is cuppable to 0′ e by an incomplete total enumeration degree. Theorem C: There exists a nonzero low Δ 2 0 enumeration degree with the anticupping property .

[1]  Jr. Hartley Rogers.  Theory of Recursive Functions and Effective Computability , 1969 .

[2]  S. Cooper.  Enumeration reducibility, nondeterministic computations and relative computability of partial functions , 1990 .

[3]  John Case,et al.  Enumeration reducibility and partial degrees , 1971 .

[4]  Andrea Sorbi,et al.  Noncappable enumeration degrees below 0e′ , 1996, Journal of Symbolic Logic.

[5]  Robert I. Soare.  Fundamentals of Recursively Enumerable Sets and the Recursion Theorem , 1987 .

[6]  D. C. Cooper,et al.  Theory of Recursive Functions and Effective Computability , 1969, The Mathematical Gazette.

[7]  S. Barry Cooper,et al.  Properly Σ2 Enumeration Degrees , 1988, Math. Log. Q..

[8]  S. Ahmad.  Embedding the diamond in the σ 2 enumeration degrees , 1991 .

[9]  H. Rogers,et al.  Reducibility and Completeness for Sets of Integers , 1959 .

[10]  C. Jockusch.  Semirecursive sets and positive reducibility , 1968 .

[11]  S. Barry Cooper,et al.  Enumeration Reducibility Using Bounded Information: Counting Minimal Covers , 1987, Mathematical Logic Quarterly.

[12]  R. Soare.  Recursively enumerable sets and degrees , 1987 .

[13]  David P. Miller.  High recursively enumerable degrees and the anti-cupping property , 1981 .

[14]  David B. Posner.  The Upper Semilattice of Degrees <0? Is Complemented , 1981, J. Symb. Log..

[15]  Kevin McEvoy,et al.  Jumps of quasi-minimal enumeration degrees , 1985, Journal of Symbolic Logic.

[16]  Kevin McEvoy,et al.  On minimal pairs of enumeration degrees , 1985, Journal of Symbolic Logic.

[17]  Robert W. Robinson,et al.  Degrees joining to 0′ , 1981, Journal of Symbolic Logic.

[18]  P. Odifreddi.  Classical recursion theory , 1989 .

[19]  S. Barry Cooper,et al.  Partial degrees and the density problem , 1982, Journal of Symbolic Logic.