AbstractWe show that the top of any diamond with bottom 0 in the r.e. degrees is also the top of a stack of n diamonds with bottom 0
AbstractIn this paper we will discuss some problems of degree-theoretic nature in connection with re...
We show that for any computably enumerable (c. e.) set A and any Δ0 2 set L, if L is low and L <T A,...
0. Introduction. We use the iterated trees of strategies approach developed in [LL1], [LL2] to prove...
AbstractWe show that the top of any diamond with bottom 0 in the r.e. degrees is also the top of a s...
This paper continues the project, initiated in [ACK], of describing general conditions under which r...
This paper continues the project, initiated in [ACK], of describing general conditions under which r...
A given c.e. degree a > 0 has a non-trivial splitting into c.e. degrees v and w if a is the join of ...
AbstractWe consider the relationship of the lattice-theoretic properties and the jump-theoretic prop...
AbstractLachlan observed that any nonzero d.c.e. degree bounds a nonzero c.e. degree. In this paper,...
This thesis is mainly concerned with the cupping property in the computably enumerable (c.e.) degree...
© Springer International Publishing Switzerland 2015. For a d.c.e. set D with a d.c.e. approximation...
We study the degrees below 0$\sp\prime$ by examining some phenomena relating two well-known hierarch...
AbstractLet b and c be r.e. Turing degrees such that b>c. We show that there is an r.e. degree a suc...
In this paper, we study the cupping property in the d.r.e. degrees, and prove the existence of a d.r...
AbstractWe prove the following three theorems on the enumeration degrees of ∑20 sets. Theorem A: The...
AbstractIn this paper we will discuss some problems of degree-theoretic nature in connection with re...
We show that for any computably enumerable (c. e.) set A and any Δ0 2 set L, if L is low and L <T A,...
0. Introduction. We use the iterated trees of strategies approach developed in [LL1], [LL2] to prove...
AbstractWe show that the top of any diamond with bottom 0 in the r.e. degrees is also the top of a s...
This paper continues the project, initiated in [ACK], of describing general conditions under which r...
This paper continues the project, initiated in [ACK], of describing general conditions under which r...
A given c.e. degree a > 0 has a non-trivial splitting into c.e. degrees v and w if a is the join of ...
AbstractWe consider the relationship of the lattice-theoretic properties and the jump-theoretic prop...
AbstractLachlan observed that any nonzero d.c.e. degree bounds a nonzero c.e. degree. In this paper,...
This thesis is mainly concerned with the cupping property in the computably enumerable (c.e.) degree...
© Springer International Publishing Switzerland 2015. For a d.c.e. set D with a d.c.e. approximation...
We study the degrees below 0$\sp\prime$ by examining some phenomena relating two well-known hierarch...
AbstractLet b and c be r.e. Turing degrees such that b>c. We show that there is an r.e. degree a suc...
In this paper, we study the cupping property in the d.r.e. degrees, and prove the existence of a d.r...
AbstractWe prove the following three theorems on the enumeration degrees of ∑20 sets. Theorem A: The...
AbstractIn this paper we will discuss some problems of degree-theoretic nature in connection with re...
We show that for any computably enumerable (c. e.) set A and any Δ0 2 set L, if L is low and L <T A,...
0. Introduction. We use the iterated trees of strategies approach developed in [LL1], [LL2] to prove...
DOI
Add to ORKG