Algorithmic Degrees of Algebraic Structures

We define a reducibility relation ⩽ between algebraic structures A ⩽ B means that A can be embeddet in an enrichment of B with partial computable operations. This notion is a generalized version of implementability as known in the theory of algebraic data types.