We show that given any (Turing) degree 0<c≤0’ and any uniformly Δ2 sequence of degrees b 0 ,b 1 ,b 2 ,.. such that ∀i(b i ≱ c), there exists 0<a<0’ such that for all i≥0, a∨b i ≱ c. If c is c.e. and b 0 ,b 1 ,b 2 ,.. are uniformly (strictly) below c then there exists such an a below c
The investigation of computably enumerable degrees has led to the deep understanding of degree struc...
In [2], Downey and Greenberg use the ordinals below ε0 to bound the number of mind-changes of comput...
Let $P(A)$ be the following property, where $A$ is any infinite set of natural numbers: \begin{displ...
We show that given any (Turing) degree 0<c≤0’ and any uniformly Δ2 sequence of degrees b 0 ,b 1 ,b 2...
A (Turing) ideal I is a downward closed set of Turing degrees which is also closed under the supremu...
This thesis is mainly concerned with the cupping property in the computably enumerable (c.e.) degree...
AbstractWe prove the following three theorems on the enumeration degrees of ∑20 sets. Theorem A: The...
We answer a question of Jockusch by showing that the measure of the Turing degrees that satisfy the ...
We show that there is a cuppable c.e. degree, all of whose cupping partners are high. In particular,...
We prove the following three theorems on the enumeration degrees of # 0 2 sets. Theorem A: There exi...
A Turing degree a satisfies the join property if, for every non-zero bb, there exists c<a with b V c...
This thesis is concerned with three special properties of Turing degree structure and the Ershov hie...
We prove the following three theorems on the enumeration degrees of Sigma(2)(0) sets. Theorem A: The...
© 2016, Association for Symbolic Logic.We study Turing degrees a for which there is a countable stru...
In [4], Downey and Greenberg define the notion of totally ⍺-c.a. for appropriately small ordinals ⍺,...
The investigation of computably enumerable degrees has led to the deep understanding of degree struc...
In [2], Downey and Greenberg use the ordinals below ε0 to bound the number of mind-changes of comput...
Let $P(A)$ be the following property, where $A$ is any infinite set of natural numbers: \begin{displ...
We show that given any (Turing) degree 0<c≤0’ and any uniformly Δ2 sequence of degrees b 0 ,b 1 ,b 2...
A (Turing) ideal I is a downward closed set of Turing degrees which is also closed under the supremu...
This thesis is mainly concerned with the cupping property in the computably enumerable (c.e.) degree...
AbstractWe prove the following three theorems on the enumeration degrees of ∑20 sets. Theorem A: The...
We answer a question of Jockusch by showing that the measure of the Turing degrees that satisfy the ...
We show that there is a cuppable c.e. degree, all of whose cupping partners are high. In particular,...
We prove the following three theorems on the enumeration degrees of # 0 2 sets. Theorem A: There exi...
A Turing degree a satisfies the join property if, for every non-zero bb, there exists c<a with b V c...
This thesis is concerned with three special properties of Turing degree structure and the Ershov hie...
We prove the following three theorems on the enumeration degrees of Sigma(2)(0) sets. Theorem A: The...
© 2016, Association for Symbolic Logic.We study Turing degrees a for which there is a countable stru...
In [4], Downey and Greenberg define the notion of totally ⍺-c.a. for appropriately small ordinals ⍺,...
The investigation of computably enumerable degrees has led to the deep understanding of degree struc...
In [2], Downey and Greenberg use the ordinals below ε0 to bound the number of mind-changes of comput...
Let $P(A)$ be the following property, where $A$ is any infinite set of natural numbers: \begin{displ...
DOI
Add to ORKG