Sciweavers

NDJFL
2010

Embeddings of Computable Structures

12 years 11 months ago
Embeddings of Computable Structures
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.
Asher M. Kach, Oscar Levin, Reed Solomon
Added 20 May 2011
Updated 20 May 2011
Type Journal
Year 2010
Where NDJFL
Authors Asher M. Kach, Oscar Levin, Reed Solomon
Comments (0)