Abstract
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.
Citation
Asher M. Kach. Oscar Levin. Reed Solomon. "Embeddings of Computable Structures." Notre Dame J. Formal Logic 51 (1) 55 - 68, 2010. https://doi.org/10.1215/00294527-2010-004
Information
