We give a proof of the fact that in every nonempty interval of $\Sigma^0_2$ enumeration degrees one can embed every countable partial order
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 show that every nonzero \Delta^0_2 e-degree bounds a minimal pair. On the other hand, there exist...
We give a proof of the fact that in every nonempty interval of $\Sigma^0_2$ enumeration degrees one ...
We give an algorithm for deciding whether an embedding of a finite partial order \mathcal{P} into th...
We show that no nontrivial principal ideal of the enumeration degrees is linearly ordered: in fact, ...
One of the most basic measures of the complexity of a given partially ordered structure is the quant...
We show that every finite lattice is embeddable into the $\Sigma^0_2$ enumeration degrees via a latt...
We show that every nonzero \Sigma^0_2 enumeration degree bounds a nonsplitting nonzero enumeration d...
Abstract. We give an algorithm for deciding whether an embedding of a finite partial order P into th...
We show that the diamond lattice can be embedded into the \Sigma^0_2 enumeration degrees preserving ...
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 show that every nonzero \Delta^0_2 e-degree bounds a minimal pair. On the other hand, there exist...
We give a proof of the fact that in every nonempty interval of $\Sigma^0_2$ enumeration degrees one ...
We give an algorithm for deciding whether an embedding of a finite partial order \mathcal{P} into th...
We show that no nontrivial principal ideal of the enumeration degrees is linearly ordered: in fact, ...
One of the most basic measures of the complexity of a given partially ordered structure is the quant...
We show that every finite lattice is embeddable into the $\Sigma^0_2$ enumeration degrees via a latt...
We show that every nonzero \Sigma^0_2 enumeration degree bounds a nonsplitting nonzero enumeration d...
Abstract. We give an algorithm for deciding whether an embedding of a finite partial order P into th...
We show that the diamond lattice can be embedded into the \Sigma^0_2 enumeration degrees preserving ...
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 show that every nonzero \Delta^0_2 e-degree bounds a minimal pair. On the other hand, there exist...
Add to ORKG