Computable embeddability for algebraic structures

In computability theory, the standard tool to classify preorders is provided by the computable reducibility. If R and S are preorders with domain ω, then R is computably reducible to S if and only ...