Splittings of effectively speedable sets and effectively levelable sets
Omanadze, Roland Sh.
J. Symbolic Logic, Tome 69 (2004) no. 1, p. 143-158 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
We prove that a computably enumerable set A is effectively speedable (effectively levelable) if and only if there exists a splitting (A0,A1) of A such that both A0 and A1 are effectively speedable (effectively levelable). These results answer two questions raised by J. B. Remmel.
Publié le : 2004-03-14
Classification:  
@article{1080938833,
     author = {Omanadze, Roland Sh.},
     title = {Splittings of effectively speedable sets and effectively
levelable sets},
     journal = {J. Symbolic Logic},
     volume = {69},
     number = {1},
     year = {2004},
     pages = { 143-158},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1080938833}
}

Omanadze, Roland Sh. Splittings of effectively speedable sets and effectively
levelable sets. J. Symbolic Logic, Tome 69 (2004) no. 1, pp.  143-158. http://gdmltest.u-ga.fr/item/1080938833/