<?xml version="1.0"?>
<dblp>
<article key="journals/bsl/CholakDH08" mdate="2009-06-23">
<author>Peter Cholak</author>
<author>Rodney G. Downey</author>
<author>Leo Harrington</author>
<title>The Complexity of Orbits of Computably Enumerable Sets.</title>
<pages>69-87</pages>
<year>2008</year>
<volume>14</volume>
<journal>Bulletin of Symbolic Logic</journal>
<number>1</number>
<ee>http://www.math.ucla.edu/~asl/bsl/1401/1401-003.ps</ee>
<url>db/journals/bsl/bsl14.html#CholakDH08</url>
</article>
</dblp>
