| [1] | Peter Cholak, Rod Downey, and Leo A. Harrington. On the Orbits of Computably Enumerable Sets. To appear in JAMS. math.LO/0607264, 2008. Pdf. |
| [2] | Peter Cholak, Rod Downey, and Leo A. Harrington. The complexity of orbits of computably enumerable sets. To appear in BSL. math.LO/0705.0125, 2007. Pdf. |
| [3] | Peter Cholak, Rod Downey, and Noam Greenberg. Strong jump-traceability and K-triviality. To appear in Advances in Mathematics, 2007. Pdf. |
This file has been generated by bibtex2html 1.87.