AbstractWe prove that for any computably enumerable (c.e.) degree c, if it is cappable in the computably enumerable degrees, then there is a d.c.e. degree d such that c∪d=0′ and c∩d=0. Consequently, a computably enumerable degree is cappable if and only if it can be complemented by a nonzero d.c.e. degree. This gives a new characterization of the cappable degrees
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 # 0 2 sets. Theorem A: There exi...
We prove the existence of noncomputable low computably enumerable degrees b < a such that b is stron...
AbstractWe prove that for any computably enumerable (c.e.) degree c, if it is cappable in the comput...
The investigation of computably enumerable degrees has led to the deep understanding of degree struc...
© 2018, Pleiades Publishing, Ltd. Questions of definability of computably enumerable degrees in the ...
Abstract. It is shown that for any computably enumerable (c.e.) degree w, if w � = 0, then there is ...
We show that there exists a minimal (Turing) degree b<0' such that for all non-zero c.e. degrees a, ...
AbstractWe show that there exists an almost everywhere (a.e.) dominating computably enumerable (c.e....
This thesis is mainly concerned with the cupping property in the computably enumerable (c.e.) degree...
We show that there is a cuppable c.e. degree, all of whose cupping partners are high. In particular,...
In this work we prove that for every pair of computably enumerable degrees a<Q b there exists a prop...
AbstractLachlan observed that any nonzero d.c.e. degree bounds a nonzero c.e. degree. In this paper,...
AbstractA set A⊆ω is called computably enumerable (c.e., for short), if there is an algorithm to enu...
Abstract. We prove that for every Σ02 enumeration degree b there exists a noncuppable Σ02 degree a&g...
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 # 0 2 sets. Theorem A: There exi...
We prove the existence of noncomputable low computably enumerable degrees b < a such that b is stron...
AbstractWe prove that for any computably enumerable (c.e.) degree c, if it is cappable in the comput...
The investigation of computably enumerable degrees has led to the deep understanding of degree struc...
© 2018, Pleiades Publishing, Ltd. Questions of definability of computably enumerable degrees in the ...
Abstract. It is shown that for any computably enumerable (c.e.) degree w, if w � = 0, then there is ...
We show that there exists a minimal (Turing) degree b<0' such that for all non-zero c.e. degrees a, ...
AbstractWe show that there exists an almost everywhere (a.e.) dominating computably enumerable (c.e....
This thesis is mainly concerned with the cupping property in the computably enumerable (c.e.) degree...
We show that there is a cuppable c.e. degree, all of whose cupping partners are high. In particular,...
In this work we prove that for every pair of computably enumerable degrees a<Q b there exists a prop...
AbstractLachlan observed that any nonzero d.c.e. degree bounds a nonzero c.e. degree. In this paper,...
AbstractA set A⊆ω is called computably enumerable (c.e., for short), if there is an algorithm to enu...
Abstract. We prove that for every Σ02 enumeration degree b there exists a noncuppable Σ02 degree a&g...
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 # 0 2 sets. Theorem A: There exi...
We prove the existence of noncomputable low computably enumerable degrees b < a such that b is stron...