Harrington, Leo (9)
Harrington, Leo A. (6)
Cholak, Peter A. (3)
Kechris, Alexander S. (2)
Shelah, Saharon (2)
Bulletin of Symbolic Logic (3)
Notre Dame Journal of Formal Logic (1)
02F25 (1)
Author: Leo Harrington
The complexity of orbits of computably enumerable sets
Cholak, Peter A., Downey, Rodney, and Harrington, Leo A.
Bulletin of Symbolic Logic Volume 14, Number 1 (March 2008), 69-87.
More by Peter A. Cholak
More by Rodney Downey
More by Leo A. Harrington
Isomorphisms of splits of computably enumerable sets
Cholak, Peter A. and Harrington, Leo A.
Journal of Symbolic Logic Volume 68, Number 3 (September 2003), 1044-1064.
Definable Encodings in the Computably Enumerable Sets
Bulletin of Symbolic Logic Volume 6, Number 2 (June, 2000), 185-196.
Codable Sets and Orbits of Computably Enumerable Sets
Harrington, Leo and Soare, Robert I.
Journal of Symbolic Logic Volume 63, Number 1 (March, 1998), 1-28.
More by Leo Harrington
More by Robert I. Soare
Definability, Automorphisms, and Dynamic Properties of Computably Enumerable Sets
Some exact equiconsistency results in set theory.
Harrington, Leo and Shelah, Saharon
Notre Dame Journal of Formal Logic Volume 26, Number 2 (April 1985), 178-188.
More by Saharon Shelah
The undecidability of the recursively enumerable degrees
Bulletin (New Series) of the American Mathematical Society Volume 6, Number 1 (January 1982), 79-80.
Definable degrees and automorphisms of $\mathcal {D}$
Harrington, Leo and Shore, Richard A.
Bulletin (New Series) of the American Mathematical Society Volume 4, Number 1 (January 1981), 97-100.
More by Richard A. Shore
Analytic Determinacy and $0^{\tt\#}$
Harrington, Leo
Journal of Symbolic Logic Volume 43, Number 4 (December, 1978), 685-693.
Models Without Indiscernibles
Abramson, Fred G. and Harrington, Leo A.
Journal of Symbolic Logic Volume 43, Number 3 (September, 1978), 572-600.
More by Fred G. Abramson