2003 |
16 | | Peter Cholak,
Leo Harrington:
Isomorphisms of splits of computably enumerable sets.
J. Symb. Log. 68(3): 1044-1064 (2003) |
2000 |
15 | EE | Peter Cholak,
Leo Harrington:
Definable encodings in the computably enumerable sets.
Bulletin of Symbolic Logic 6(2): 185-196 (2000) |
1998 |
14 | | Leo Harrington,
Robert I. Soare:
Definable Properties of the Computably Enumerable Sets.
Ann. Pure Appl. Logic 94(1-3): 97-125 (1998) |
13 | | Leo Harrington,
Robert I. Soare:
Codable Sets and Orbits of Computably Enumerable Sets.
J. Symb. Log. 63(1): 1-28 (1998) |
1996 |
12 | | Rodney G. Downey,
Leo Harrington:
There is No Fat Orbit.
Ann. Pure Appl. Logic 80(3): 277-289 (1996) |
11 | EE | Leo Harrington,
Robert I. Soare:
Definability, automorphisms, and dynamic properties of computably enumerable sets.
Bulletin of Symbolic Logic 2(2): 199-213 (1996) |
1991 |
10 | | S. Barry Cooper,
Leo Harrington,
Alistair H. Lachlan,
Steffen Lempp,
Robert I. Soare:
The d.r.e. Degrees are Not Dense.
Ann. Pure Appl. Logic 55(2): 125-151 (1991) |
1982 |
9 | | Yuri Gurevich,
Leo Harrington:
Trees, Automata, and Games
STOC 1982: 60-65 |
1978 |
8 | | Fred G. Abramson,
Leo Harrington:
Models Without Indiscernibles.
J. Symb. Log. 43(3): 572-600 (1978) |
7 | | Leo Harrington:
Analytic Determinacy and 0 #.
J. Symb. Log. 43(4): 685-693 (1978) |
1977 |
6 | | Solomon Feferman,
Jon Barwise,
Leo Harrington:
Meeting of the Association for Symbolic Logic: Reno, 1976.
J. Symb. Log. 42(1): 156-160 (1977) |
1976 |
5 | | Leo Harrington,
David B. MacQueen:
Selection in Abstract Recursion Theory.
J. Symb. Log. 41(1): 153-158 (1976) |
4 | | Leo Harrington,
Thomas Jech:
On sigma1 Well-Orderings of the Universe.
J. Symb. Log. 41(1): 167-170 (1976) |
3 | | James E. Baumgartner,
Leo Harrington,
E. M. Kleinberg:
Adding a Closed Unbounded Set.
J. Symb. Log. 41(2): 481-482 (1976) |
1975 |
2 | | Leo Harrington,
Alexander S. Kechris:
On Characterizing Spector Classes.
J. Symb. Log. 40(1): 19-24 (1975) |
1974 |
1 | | Leo Harrington:
Recursively Presentable Prime Models.
J. Symb. Log. 39(2): 305-309 (1974) |