Let us say that any (Turing) degree d > 0satisfies the minimal complementation property (MCP) if for every degree 0 < a < d there exists a minimal degree b < d such that a ∨ b = d (and therefore a ∧ b = 0). We show that every degree d ≥ 0′ satisfies MCP
AbstractWe prove that for any computably enumerable (c.e.) degree c, if it is cappable in the comput...
In this thesis we look at some properties of the local Turing Degrees, as a partial order. We first...
AbstractWe study generalizations of shortest programs as they pertain to Schaefer’s MIN∗ problem. We...
Let us say that any (Turing) degree d > 0satisfies the minimal complementation property (MCP) if for...
It is shown that for every (Turing) degree 0 <a <0' there is a minimal degree m <0' such that a∨ m=0...
We show that there exists a properly Σ2 minimal (Turing) degree b, and moreover that b can be chosen...
We show that there exists a minimal (Turing) degree b<0' such that for all non-zero c.e. degrees a, ...
Working in the Turing degree structure, we show that those degrees which contain computably enumerab...
Abstract. We show that there exists a Turing degree which is minimal and fixed point free. 1
Theorem: There is a non-empty \Pi 0 1 class of reals, each of which computes a real of minimal (Tur...
Abstract. We show that there is a strong minimal pair in the computably enumerable Turing degrees, i...
Abstract. We show that every generalized high Turing degree is the join of two minimal degrees. 1
In this thesis we look at whether two different classes of local Turing degrees (the c.e. degrees, a...
A Turing degree a satisfies the join property if, for every non-zero bb, there exists c<a with b V c...
AbstractTheorem. There is a non-empty Π10 class of reals, each of which computes a real of minimal (...
AbstractWe prove that for any computably enumerable (c.e.) degree c, if it is cappable in the comput...
In this thesis we look at some properties of the local Turing Degrees, as a partial order. We first...
AbstractWe study generalizations of shortest programs as they pertain to Schaefer’s MIN∗ problem. We...
Let us say that any (Turing) degree d > 0satisfies the minimal complementation property (MCP) if for...
It is shown that for every (Turing) degree 0 <a <0' there is a minimal degree m <0' such that a∨ m=0...
We show that there exists a properly Σ2 minimal (Turing) degree b, and moreover that b can be chosen...
We show that there exists a minimal (Turing) degree b<0' such that for all non-zero c.e. degrees a, ...
Working in the Turing degree structure, we show that those degrees which contain computably enumerab...
Abstract. We show that there exists a Turing degree which is minimal and fixed point free. 1
Theorem: There is a non-empty \Pi 0 1 class of reals, each of which computes a real of minimal (Tur...
Abstract. We show that there is a strong minimal pair in the computably enumerable Turing degrees, i...
Abstract. We show that every generalized high Turing degree is the join of two minimal degrees. 1
In this thesis we look at whether two different classes of local Turing degrees (the c.e. degrees, a...
A Turing degree a satisfies the join property if, for every non-zero bb, there exists c<a with b V c...
AbstractTheorem. There is a non-empty Π10 class of reals, each of which computes a real of minimal (...
AbstractWe prove that for any computably enumerable (c.e.) degree c, if it is cappable in the comput...
In this thesis we look at some properties of the local Turing Degrees, as a partial order. We first...
AbstractWe study generalizations of shortest programs as they pertain to Schaefer’s MIN∗ problem. We...
DOI
Add to ORKG