Add to ORKGWe prove the following three theorems on the enumeration degrees of # 0 2 sets. Theorem A: There exists a nonzero noncuppable # 0 2 enumeration degree. Theorem B: Every nonzero # 0 2 enumeration degree is cuppable to 0 # e by an incomplete total enumeration degree. Theorem C: There exists a nonzero low # 0 2 enumeration degree with the anticupping property
Abstract. We show that every nonzero ∆ 0 2 e-degree bounds a minimal pair. On the other hand, there ...
This paper continues the project, initiated in [ACK], of describing general conditions under which r...
Abstract. We show that if A and B form a nontrivial K-pair, then there is a semi-computable set C su...
AbstractWe prove the following three theorems on the enumeration degrees of ∑20 sets. Theorem A: The...
We prove the following three theorems on the enumeration degrees of Sigma(2)(0) sets. Theorem A: The...
Abstract. In this paper we prove that every nonzero ∆02 e-degree is cuppable to 0′e by a 1-generic ∆...
This thesis is mainly concerned with the cupping property in the computably enumerable (c.e.) degree...
Using properties of $\mathcal{K}$-pairs of sets, we show that every nonzero enumeration degree $\mat...
The investigation of computably enumerable degrees has led to the deep understanding of degree struc...
We prove the existence of noncomputable low computably enumerable degrees b < a such that b is stron...
We show that every nonzero \Sigma^0_2 enumeration degree bounds a nonsplitting nonzero enumeration d...
Abstract. We exhibit finite injury constructions of both a high and low2 non cuppable Σ02 enumeratio...
We give an alternative and more informative proof that every incomplete \sigmazerotwo-enumeration d...
We prove that each ∑02 set which is hypersimple relative to 0′ is noncuppable in the structure of th...
Abstract. We prove that for every Σ02 enumeration degree b there exists a noncuppable Σ02 degree a&g...
Abstract. We show that every nonzero ∆ 0 2 e-degree bounds a minimal pair. On the other hand, there ...
This paper continues the project, initiated in [ACK], of describing general conditions under which r...
Abstract. We show that if A and B form a nontrivial K-pair, then there is a semi-computable set C su...
AbstractWe prove the following three theorems on the enumeration degrees of ∑20 sets. Theorem A: The...
We prove the following three theorems on the enumeration degrees of Sigma(2)(0) sets. Theorem A: The...
Abstract. In this paper we prove that every nonzero ∆02 e-degree is cuppable to 0′e by a 1-generic ∆...
This thesis is mainly concerned with the cupping property in the computably enumerable (c.e.) degree...
Using properties of $\mathcal{K}$-pairs of sets, we show that every nonzero enumeration degree $\mat...
The investigation of computably enumerable degrees has led to the deep understanding of degree struc...
We prove the existence of noncomputable low computably enumerable degrees b < a such that b is stron...
We show that every nonzero \Sigma^0_2 enumeration degree bounds a nonsplitting nonzero enumeration d...
Abstract. We exhibit finite injury constructions of both a high and low2 non cuppable Σ02 enumeratio...
We give an alternative and more informative proof that every incomplete \sigmazerotwo-enumeration d...
We prove that each ∑02 set which is hypersimple relative to 0′ is noncuppable in the structure of th...
Abstract. We prove that for every Σ02 enumeration degree b there exists a noncuppable Σ02 degree a&g...
Abstract. We show that every nonzero ∆ 0 2 e-degree bounds a minimal pair. On the other hand, there ...
This paper continues the project, initiated in [ACK], of describing general conditions under which r...
Abstract. We show that if A and B form a nontrivial K-pair, then there is a semi-computable set C su...