![]() |
@article{DBLP:journals/bsl/CholakDH08,
author = {Peter Cholak and
Rodney G. Downey and
Leo Harrington},
title = {The Complexity of Orbits of Computably Enumerable Sets},
journal = {Bulletin of Symbolic Logic},
volume = {14},
number = {1},
year = {2008},
pages = {69-87},
ee = {http://www.math.ucla.edu/$\sim$asl/bsl/1401/1401-003.ps},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Copyright © 2009-06-23 by Michael Ley (ley@uni-trier.de)