 Equivalently, a strong reducibility relation is one whose degrees form a finer equivalence relation than the Turing degrees, while a weak reducibility relation is one whose degrees form a coarser equivalence relation than Turing equivalence.The strong reducibilities include
Many of these were introduced by Post (1944).Post was searching for a non-recursive, recursively enumerable set which the halting problem could not be Turing reduced to.