Embeddings of Computable Structures
Asher M. Kach, Oscar Levin, Reed Solomon · Notre Dame Journal of Formal Logic · 2010
We study what the existence of a classical embedding between computable structures implies about the existence of computable embeddings. In particular, we consider the effect of fixing and varying the computable presentations of the computable structures.