Embeddings of Computable Structures
Kach, Asher M. ; Levin, Oscar ; Solomon, Reed
Notre Dame J. Formal Logic, Tome 51 (2010) no. 1, p. 55-68 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
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.
Publié le : 2010-01-15
Classification:  computable embedding,  strong embedding property,  weak domain embedding property,  weak range embedding property,  weak embedding property,  03C57,  03D45 
@article{1273002109,
     author = {Kach, Asher M. and Levin, Oscar and Solomon, Reed},
     title = {Embeddings of Computable Structures},
     journal = {Notre Dame J. Formal Logic},
     volume = {51},
     number = {1},
     year = {2010},
     pages = { 55-68},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1273002109}
}

Kach, Asher M.; Levin, Oscar; Solomon, Reed. Embeddings of Computable Structures. Notre Dame J. Formal Logic, Tome 51 (2010) no. 1, pp.  55-68. http://gdmltest.u-ga.fr/item/1273002109/