Constructing minimal pairs of degrees

Abstract

We prove that there exist sets of natural numbers $A$ and $B$ such that $A$ and $B$ form a minimal pair with respect to Turing reducibility, enumeration reducibility, hyperarithmetical reducibility and hyperenumeration reducibility. Relativized versions of this result are presented as well.