Add to ORKGAbstract In the paper the exact pair theorem for the ω-enumeration degrees is proved. As a corollary an exact pair theorem involving the jump operation for the enumeration degrees is obtained. Mathematics subject classification: 03D30 Key words and phrases: ω-enumeration degrees; enumeration degrees; exact pair; jump.
this paper. Clearly the most remarkable result relating the jump operator to the ordering of degrees...
We consider the question of the existence of complements for the enumeration degrees of cocomputably...
This paper continues the project, initiated in [ACK], of describing general conditions under which r...
Abstract. We show that if A and B form a nontrivial K-pair, then there is a semi-computable set C su...
Using properties of $\mathcal{K}$-pairs of sets, we show that every nonzero enumeration degree $\mat...
Abstract. We study Kalimullin pairs, a definable class (of pairs) of enumera-tion degrees that has b...
Proof uses forcing on perfect trees for 2-quantifier sentences in the language of arithmetic. The re...
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 review recent developments in the study of jump classes in com- putably enumerable degrees, with ...
Abstract. A set A is symmetric enumeration (se-) reducible to a set B (A≤seB) if A is enumeration re...
We investigate the relationship of (jumps of) the degrees of split-tings of a computably enumerable ...
In this paper we study partial regular enumerations for arbitrary recursive ordinal. We use the tech...
Abstract. We prove that for every Σ02 enumeration degree b there exists a noncuppable Σ02 degree a&g...
this paper. Clearly the most remarkable result relating the jump operator to the ordering of degrees...
We consider the question of the existence of complements for the enumeration degrees of cocomputably...
This paper continues the project, initiated in [ACK], of describing general conditions under which r...
Abstract. We show that if A and B form a nontrivial K-pair, then there is a semi-computable set C su...
Using properties of $\mathcal{K}$-pairs of sets, we show that every nonzero enumeration degree $\mat...
Abstract. We study Kalimullin pairs, a definable class (of pairs) of enumera-tion degrees that has b...
Proof uses forcing on perfect trees for 2-quantifier sentences in the language of arithmetic. The re...
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 review recent developments in the study of jump classes in com- putably enumerable degrees, with ...
Abstract. A set A is symmetric enumeration (se-) reducible to a set B (A≤seB) if A is enumeration re...
We investigate the relationship of (jumps of) the degrees of split-tings of a computably enumerable ...
In this paper we study partial regular enumerations for arbitrary recursive ordinal. We use the tech...
Abstract. We prove that for every Σ02 enumeration degree b there exists a noncuppable Σ02 degree a&g...
this paper. Clearly the most remarkable result relating the jump operator to the ordering of degrees...
We consider the question of the existence of complements for the enumeration degrees of cocomputably...
This paper continues the project, initiated in [ACK], of describing general conditions under which r...