A computably categorical structure whose expansion by a constant has infinite computable dimension
Hirschfeldt, Denis R. ; Khoussainov, Bakhadyr ; Shore, Richard A.
J. Symbolic Logic, Tome 68 (2003) no. 1, p. 1199-1241 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
Cholak, Goncharov, Khoussainov, and Shore showed that for each k>0 there is a computably categorical structure whose expansion by a constant has computable dimension k. We show that the same is true with k replaced by ω. Our proof uses a version of Goncharov’s method of left and right operations.
Publié le : 2003-12-14
Classification:  
@article{1067620182,
     author = {Hirschfeldt, Denis R. and Khoussainov, Bakhadyr and Shore, Richard A.},
     title = {A computably categorical structure whose expansion by a constant
 has infinite computable dimension},
     journal = {J. Symbolic Logic},
     volume = {68},
     number = {1},
     year = {2003},
     pages = { 1199-1241},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1067620182}
}

Hirschfeldt, Denis R.; Khoussainov, Bakhadyr; Shore, Richard A. A computably categorical structure whose expansion by a constant
 has infinite computable dimension. J. Symbolic Logic, Tome 68 (2003) no. 1, pp.  1199-1241. http://gdmltest.u-ga.fr/item/1067620182/