Add to ORKGWe give an algorithm for deciding whether an embedding of a finite partial order \mathcal{P} into the enumeration degrees of the \Sigma^0_2-sets can always be extended to an embedding of a finite partial order \mathcal{Q} \supset \mathcal{P}
We exhibit some automorphism bases for the enumeration degrees, and we derive some consequences rela...
Abstract. A set A is symmetric enumeration (se-) reducible to a set B (A≤seB) if A is enumeration re...
We prove the following three theorems on the enumeration degrees of Sigma(2)(0) sets. Theorem A: The...
We give an algorithm for deciding whether an embedding of a finite partial order \mathcal{P} into th...
Abstract. We give an algorithm for deciding whether an embedding of a finite partial order P into th...
We give a proof of the fact that in every nonempty interval of $\Sigma^0_2$ enumeration degrees one ...
We show that every finite lattice is embeddable into the $\Sigma^0_2$ enumeration degrees via a latt...
One of the most basic measures of the complexity of a given partially ordered structure is the quant...
Abstract. We survey the current status of an old open question in classical computability theory: Wh...
We prove that each ∑02 set which is hypersimple relative to 0′ is noncuppable in the structure of th...
We show that no nontrivial principal ideal of the enumeration degrees is linearly ordered: in fact, ...
We show that every incomplete Sigma_0^2 enumeration degree is meet-reducible in the structure of the...
We give a survey of some recent results on the enumeration degrees of the Sigma_2^0 set
We exhibit some automorphism bases for the enumeration degrees, and we derive some consequences rela...
Abstract. A set A is symmetric enumeration (se-) reducible to a set B (A≤seB) if A is enumeration re...
We prove the following three theorems on the enumeration degrees of Sigma(2)(0) sets. Theorem A: The...
We give an algorithm for deciding whether an embedding of a finite partial order \mathcal{P} into th...
Abstract. We give an algorithm for deciding whether an embedding of a finite partial order P into th...
We give a proof of the fact that in every nonempty interval of $\Sigma^0_2$ enumeration degrees one ...
We show that every finite lattice is embeddable into the $\Sigma^0_2$ enumeration degrees via a latt...
One of the most basic measures of the complexity of a given partially ordered structure is the quant...
Abstract. We survey the current status of an old open question in classical computability theory: Wh...
We prove that each ∑02 set which is hypersimple relative to 0′ is noncuppable in the structure of th...
We show that no nontrivial principal ideal of the enumeration degrees is linearly ordered: in fact, ...
We show that every incomplete Sigma_0^2 enumeration degree is meet-reducible in the structure of the...
We give a survey of some recent results on the enumeration degrees of the Sigma_2^0 set
We exhibit some automorphism bases for the enumeration degrees, and we derive some consequences rela...
Abstract. A set A is symmetric enumeration (se-) reducible to a set B (A≤seB) if A is enumeration re...
We prove the following three theorems on the enumeration degrees of Sigma(2)(0) sets. Theorem A: The...