DOIAbstract
We show that every incomplete Sigma_0^2 enumeration degree is meet-reducible in the structure of the enumeration degrees of the Sigma(2)(0) sets
We show that every incomplete Sigma_0^2 enumeration degree is meet-reducible in the structure of the enumeration degrees of the Sigma(2)(0) sets
Using properties of $\mathcal{K}$-pairs of sets, we show that every nonzero enumeration degree $\mat...
Abstract. We give an algorithm for deciding whether an embedding of a finite partial order P into th...
AbstractWe prove the following three theorems on the enumeration degrees of ∑20 sets. Theorem A: The...
We show that every incomplete Sigma_0^2 enumeration degree is meet-reducible in the structure of the...
We prove the following three theorems on the enumeration degrees of Sigma(2)(0) sets. Theorem A: The...
We give an alternative and more informative proof that every incomplete \sigmazerotwo-enumeration d...
We give a survey of some recent results on the enumeration degrees of the Sigma_2^0 set
We prove that each ∑02 set which is hypersimple relative to 0′ is noncuppable in the structure of th...
We prove the following three theorems on the enumeration degrees of # 0 2 sets. Theorem A: There exi...
We show that for every enumeration degree a < 0' there exists an e-degree c such that a < c &l...
We give an algorithm for deciding whether an embedding of a finite partial order \mathcal{P} into th...
Abstract. A set A is symmetric enumeration (se-) reducible to a set B (A≤seB) if A is enumeration re...
We give a proof of the fact that in every nonempty interval of $\Sigma^0_2$ enumeration degrees one ...
We show that every nonzero \Sigma^0_2 enumeration degree bounds a nonsplitting nonzero enumeration d...
Using properties of $\mathcal{K}$-pairs of sets, we show that every nonzero enumeration degree $\mat...
Abstract. We give an algorithm for deciding whether an embedding of a finite partial order P into th...
AbstractWe prove the following three theorems on the enumeration degrees of ∑20 sets. Theorem A: The...
We show that every incomplete Sigma_0^2 enumeration degree is meet-reducible in the structure of the...
We prove the following three theorems on the enumeration degrees of Sigma(2)(0) sets. Theorem A: The...
We give an alternative and more informative proof that every incomplete \sigmazerotwo-enumeration d...
We give a survey of some recent results on the enumeration degrees of the Sigma_2^0 set
We prove that each ∑02 set which is hypersimple relative to 0′ is noncuppable in the structure of th...
We prove the following three theorems on the enumeration degrees of # 0 2 sets. Theorem A: There exi...
We show that for every enumeration degree a < 0' there exists an e-degree c such that a < c &l...
We give an algorithm for deciding whether an embedding of a finite partial order \mathcal{P} into th...
Abstract. A set A is symmetric enumeration (se-) reducible to a set B (A≤seB) if A is enumeration re...
We give a proof of the fact that in every nonempty interval of $\Sigma^0_2$ enumeration degrees one ...
We show that every nonzero \Sigma^0_2 enumeration degree bounds a nonsplitting nonzero enumeration d...
Using properties of $\mathcal{K}$-pairs of sets, we show that every nonzero enumeration degree $\mat...
Abstract. We give an algorithm for deciding whether an embedding of a finite partial order P into th...
AbstractWe prove the following three theorems on the enumeration degrees of ∑20 sets. Theorem A: The...
Add to ORKG