AbstractWe show that there exists an almost everywhere (a.e.) dominating computably enumerable (c.e.) degree which is half of a minimal pair
We show that there exists a non-empty $\Pi^0_1$ class, with no recursive element, in which no member...
AbstractWe prove the following three theorems on the enumeration degrees of ∑20 sets. Theorem A: The...
Abstract. We show that there is a strong minimal pair in the computably enumerable Turing degrees, i...
AbstractWe show that there exists an almost everywhere (a.e.) dominating computably enumerable (c.e....
AbstractWe prove that for any computably enumerable (c.e.) degree c, if it is cappable in the comput...
Working in the Turing degree structure, we show that those degrees which contain computably enumerab...
AbstractA set A⊆ω is called computably enumerable (c.e., for short), if there is an algorithm to enu...
AbstractWe show that if 0′ is c.e. traceable by a, then a is array non-computable. It follows that t...
In this thesis we look at some properties of the local Turing Degrees, as a partial order. We first...
In [4], Downey and Greenberg define the notion of totally ⍺-c.a. for appropriately small ordinals ⍺,...
Let ω denote the set of natural numbers. For functions f, g: ω → ω, we say that f is dominated by g ...
The investigation of computably enumerable degrees has led to the deep understanding of degree struc...
In this thesis we look at whether two different classes of local Turing degrees (the c.e. degrees, a...
In the paper we present a survey on n-c.e. Turing and e-degrees. Also we discuss some open problems ...
We look at various properties of the computably enumerable (c.e.) not totally ω-c.e. Turing degrees....
We show that there exists a non-empty $\Pi^0_1$ class, with no recursive element, in which no member...
AbstractWe prove the following three theorems on the enumeration degrees of ∑20 sets. Theorem A: The...
Abstract. We show that there is a strong minimal pair in the computably enumerable Turing degrees, i...
AbstractWe show that there exists an almost everywhere (a.e.) dominating computably enumerable (c.e....
AbstractWe prove that for any computably enumerable (c.e.) degree c, if it is cappable in the comput...
Working in the Turing degree structure, we show that those degrees which contain computably enumerab...
AbstractA set A⊆ω is called computably enumerable (c.e., for short), if there is an algorithm to enu...
AbstractWe show that if 0′ is c.e. traceable by a, then a is array non-computable. It follows that t...
In this thesis we look at some properties of the local Turing Degrees, as a partial order. We first...
In [4], Downey and Greenberg define the notion of totally ⍺-c.a. for appropriately small ordinals ⍺,...
Let ω denote the set of natural numbers. For functions f, g: ω → ω, we say that f is dominated by g ...
The investigation of computably enumerable degrees has led to the deep understanding of degree struc...
In this thesis we look at whether two different classes of local Turing degrees (the c.e. degrees, a...
In the paper we present a survey on n-c.e. Turing and e-degrees. Also we discuss some open problems ...
We look at various properties of the computably enumerable (c.e.) not totally ω-c.e. Turing degrees....
We show that there exists a non-empty $\Pi^0_1$ class, with no recursive element, in which no member...
AbstractWe prove the following three theorems on the enumeration degrees of ∑20 sets. Theorem A: The...
Abstract. We show that there is a strong minimal pair in the computably enumerable Turing degrees, i...
DOI
Add to ORKG