AbstractWe show that there exists an almost everywhere (a.e.) dominating computably enumerable (c.e.) degree which is half of a minimal pair
A dominating set in a graph G = (V, E) is a set S such that every vertex of G is either in S or adja...
Let us say that any (Turing) degree d > 0satisfies the minimal complementation property (MCP) if for...
We show that there exists a set A such that A has quasi-minimal enumeration degree, and there are un...
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...
The investigation of computably enumerable degrees has led to the deep understanding of degree struc...
Abstract. We show that there is a strong minimal pair in the computably enumerable Turing degrees, i...
This thesis is mainly concerned with the cupping property in the computably enumerable (c.e.) degree...
We prove the existence of noncomputable low computably enumerable degrees b < a such that b is stron...
© 2017, Pleiades Publishing, Ltd. We establish that the set of minimal generalized computable enumer...
We prove that a partially ordered set of all computably enumerable (c. e.) degrees that are the leas...
We show that there exists a minimal (Turing) degree b<0' such that for all non-zero c.e. degrees a, ...
The natural embedding of the Turing degrees into the enumeration degrees preserves the jump operatio...
Abstract. We show that every nonzero ∆ 0 2 e-degree bounds a minimal pair. On the other hand, there ...
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,...
A dominating set in a graph G = (V, E) is a set S such that every vertex of G is either in S or adja...
Let us say that any (Turing) degree d > 0satisfies the minimal complementation property (MCP) if for...
We show that there exists a set A such that A has quasi-minimal enumeration degree, and there are un...
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...
The investigation of computably enumerable degrees has led to the deep understanding of degree struc...
Abstract. We show that there is a strong minimal pair in the computably enumerable Turing degrees, i...
This thesis is mainly concerned with the cupping property in the computably enumerable (c.e.) degree...
We prove the existence of noncomputable low computably enumerable degrees b < a such that b is stron...
© 2017, Pleiades Publishing, Ltd. We establish that the set of minimal generalized computable enumer...
We prove that a partially ordered set of all computably enumerable (c. e.) degrees that are the leas...
We show that there exists a minimal (Turing) degree b<0' such that for all non-zero c.e. degrees a, ...
The natural embedding of the Turing degrees into the enumeration degrees preserves the jump operatio...
Abstract. We show that every nonzero ∆ 0 2 e-degree bounds a minimal pair. On the other hand, there ...
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,...
A dominating set in a graph G = (V, E) is a set S such that every vertex of G is either in S or adja...
Let us say that any (Turing) degree d > 0satisfies the minimal complementation property (MCP) if for...
We show that there exists a set A such that A has quasi-minimal enumeration degree, and there are un...
DOI
Add to ORKG