We show that we can embed
any countable partial ordering into a class of co-r.e. bi-dense subsets of the
rationals, each subset of a fixed nonzero r.e. Turing degree, under an order
induced by recursive similarity transformations. Also, we show that we can
embed any countable partial ordering into the co-simple isols under either
the order induced by addition of isols or the order induced by recursive
injections.