Recursively Presentable Prime Models. - Leo Harrington (J. Symb. Log., 1974)

On Characterizing Spector Classes. - Leo Harrington; Alexander S. Kechris (J. Symb. Log., 1975)

Adding a Closed Unbounded Set. - James E. Baumgartner; Leo Harrington; E. M. Kleinberg (J. Symb. Log., 1976)

On sigma1 Well-Orderings of the Universe. - Leo Harrington; Thomas Jech (J. Symb. Log., 1976)

Selection in Abstract Recursion Theory. - Leo Harrington; David B. MacQueen (J. Symb. Log., 1976)

Meeting of the Association for Symbolic Logic: Reno, 1976. - Solomon Feferman; Jon Barwise; Leo Harrington (J. Symb. Log., 1977)

Models Without Indiscernibles. - Fred G. Abramson; Leo Harrington (J. Symb. Log., 1978)

Analytic Determinacy and 0 #. - Leo Harrington (J. Symb. Log., 1978)

Extensions of countable infinitary logic which preserve most of its nice properties. - Leo Harrington (Arch. Math. Log., 1980)

Trees, Automata, and Games - Yuri Gurevich; Leo Harrington (STOC, 1982)

Fundamentals of forking. - Victor Harnik; Leo Harrington (Ann. Pure Appl. Log., 1984)

aleph0-Categorical, aleph0-stable structures. - Gregory L. Cherlin; Leo Harrington; Alistair H. Lachlan (Ann. Pure Appl. Log., 1985)

An exposition of Shelah's "main gap": counting uncountable models of ω-stable and superstable theories. - Leo Harrington; Michael Makkai (Notre Dame J. Formal Log., 1985)

Some exact equiconsistency results in set theory. - Leo Harrington; Saharon Shelah (Notre Dame J. Formal Log., 1985)

Trivial pursuit: Remarks on the main gap. - John T. Baldwin 001; Leo Harrington (Ann. Pure Appl. Log., 1987)

The d.r.e. Degrees are Not Dense. - S. Barry Cooper; Leo Harrington; Alistair H. Lachlan; Steffen Lempp; Robert I. Soare (Ann. Pure Appl. Log., 1991)

There is No Fat Orbit. - Rodney G. Downey; Leo Harrington (Ann. Pure Appl. Log., 1996)

Definability, automorphisms, and dynamic properties of computably enumerable sets. - Leo Harrington; Robert I. Soare (Bull. Symb. Log., 1996)

Definable Properties of the Computably Enumerable Sets. - Leo Harrington; Robert I. Soare (Ann. Pure Appl. Log., 1998)

Codable Sets and Orbits of Computably Enumerable Sets. - Leo Harrington; Robert I. Soare (J. Symb. Log., 1998)

Definable encodings in the computably enumerable sets. - Peter Cholak; Leo Harrington (Bull. Symb. Log., 2000)

On the Definability of the double jump in the computably Enumerable Sets. - Peter A. Cholak; Leo Harrington (J. Math. Log., 2002)

Isomorphisms of splits of computably enumerable sets. - Peter Cholak; Leo Harrington (J. Symb. Log., 2003)

The Complexity of Orbits of Computably Enumerable Sets. - Peter Cholak; Rodney G. Downey; Leo Harrington (Bull. Symb. Log., 2008)

Σ _1^1 in Every Real in a Σ _1^1 Class of Reals Is Σ _1^1. - Leo Harrington; Richard A. Shore; Theodore A. Slaman (Computability and Complexity, 2017)

Corrigendum to "The d.r.e. degrees are not dense" [Ann. Pure Appl. Logic 55 (1991) 125-151]. - S. Barry Cooper; Leo Harrington; Alistair H. Lachlan; Steffen Lempp; Robert I. Soare (Ann. Pure Appl. Log., 2017)