Leo Harrington

26 papers A* 1Journal 24Unranked 1
YearRankTypeTitle / Venue / Authors
2017 J jnl
Corrigendum to "The d.r.e. degrees are not dense" [Ann. Pure Appl. Logic 55 (1991) 125-151].
Ann. Pure Appl. Log.
S. Barry Cooper, Leo Harrington, Alistair H. Lachlan, Steffen Lempp, Robert I. Soare
2017 — conf
Σ _1^1 in Every Real in a Σ _1^1 Class of Reals Is Σ _1^1.
Computability and Complexity
Leo Harrington, Richard A. Shore, Theodore A. Slaman
2008 J jnl
The Complexity of Orbits of Computably Enumerable Sets.
Bull. Symb. Log.
Peter Cholak, Rodney G. Downey, Leo Harrington
2003 J jnl
Isomorphisms of splits of computably enumerable sets.
J. Symb. Log.
Peter Cholak, Leo Harrington
2002 J jnl
On the Definability of the double jump in the computably Enumerable Sets.
J. Math. Log.
Peter A. Cholak, Leo Harrington
2000 J jnl
Definable encodings in the computably enumerable sets.
Bull. Symb. Log.
Peter Cholak, Leo Harrington
1998 J jnl
Codable Sets and Orbits of Computably Enumerable Sets.
J. Symb. Log.
Leo Harrington, Robert I. Soare
1998 J jnl
Definable Properties of the Computably Enumerable Sets.
Ann. Pure Appl. Log.
Leo Harrington, Robert I. Soare
1996 J jnl
Definability, automorphisms, and dynamic properties of computably enumerable sets.
Bull. Symb. Log.
Leo Harrington, Robert I. Soare
1996 J jnl
There is No Fat Orbit.
Ann. Pure Appl. Log.
Rodney G. Downey, Leo Harrington
1991 J jnl
The d.r.e. Degrees are Not Dense.
Ann. Pure Appl. Log.
S. Barry Cooper, Leo Harrington, Alistair H. Lachlan, Steffen Lempp, Robert I. Soare
1987 J jnl
Trivial pursuit: Remarks on the main gap.
Ann. Pure Appl. Log.
John T. Baldwin, Leo Harrington
1985 J jnl
An exposition of Shelah's "main gap": counting uncountable models of ω-stable and superstable theories.
Notre Dame J. Formal Log.
Leo Harrington, Michael Makkai
1985 J jnl
Some exact equiconsistency results in set theory.
Notre Dame J. Formal Log.
Leo Harrington, Saharon Shelah
1985 J jnl
aleph
Ann. Pure Appl. Log.
Gregory L. Cherlin, Leo Harrington, Alistair H. Lachlan
1984 J jnl
Fundamentals of forking.
Ann. Pure Appl. Log.
Victor Harnik, Leo Harrington
1982 A* conf
Trees, Automata, and Games
STOC
Yuri Gurevich, Leo Harrington
1980 J jnl
Extensions of countable infinitary logic which preserve most of its nice properties.
Arch. Math. Log.
Leo Harrington
1978 J jnl
Analytic Determinacy and 0
J. Symb. Log.
Leo Harrington
1978 J jnl
Models Without Indiscernibles.
J. Symb. Log.
Fred G. Abramson, Leo Harrington
1977 J jnl
Meeting of the Association for Symbolic Logic: Reno, 1976.
J. Symb. Log.
Solomon Feferman, Jon Barwise, Leo Harrington
1976 J jnl
Adding a Closed Unbounded Set.
J. Symb. Log.
James E. Baumgartner, Leo Harrington, E. M. Kleinberg
1976 J jnl
On sigma
J. Symb. Log.
Leo Harrington, Thomas Jech
1976 J jnl
Selection in Abstract Recursion Theory.
J. Symb. Log.
Leo Harrington, David B. MacQueen
1975 J jnl
On Characterizing Spector Classes.
J. Symb. Log.
Leo Harrington, Alexander S. Kechris
1974 J jnl
Recursively Presentable Prime Models.
J. Symb. Log.
Leo Harrington