Embeddings of Computable Structures

Asher M. Kach, Oscar Levin, Reed Solomon
2010 Notre Dame Journal of Formal Logic  
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.
doi:10.1215/00294527-2010-004 fatcat:b54b5jizm5dylkkvddclvvbw6a