Leo Harrington

According to our database, Leo Harrington authored at least 26 papers between 1974 and 2017.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

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

Σ _1^1 in Every Real in a Σ _1^1 Class of Reals Is Σ _1^1.

Leo Harrington, Richard A. Shore, Theodore A. Slaman

Proceedings of the Computability and Complexity, 2017

2008

The Complexity of Orbits of Computably Enumerable Sets.

Peter Cholak, Rodney G. Downey, Leo Harrington

Bull. Symb. Log., 2008

2003

Isomorphisms of splits of computably enumerable sets.

Peter Cholak, Leo Harrington

J. Symb. Log., 2003

2002

On the Definability of the double jump in the computably Enumerable Sets.

Peter A. Cholak, Leo Harrington

J. Math. Log., 2002

2000

Definable encodings in the computably enumerable sets.

Peter Cholak, Leo Harrington

Bull. Symb. Log., 2000

1998

Codable Sets and Orbits of Computably Enumerable Sets.

Leo Harrington, Robert I. Soare

J. Symb. Log., 1998

Definable Properties of the Computably Enumerable Sets.

Leo Harrington, Robert I. Soare

Ann. Pure Appl. Log., 1998

1996

Definability, automorphisms, and dynamic properties of computably enumerable sets.

Leo Harrington, Robert I. Soare

Bull. Symb. Log., 1996

There is No Fat Orbit.

Rodney G. Downey, Leo Harrington

Ann. Pure Appl. Log., 1996

1991

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

1987

Trivial pursuit: Remarks on the main gap.

John T. Baldwin, Leo Harrington

Ann. Pure Appl. Log., 1987

1985

Some exact equiconsistency results in set theory.

Leo Harrington, Saharon Shelah

Notre Dame J. Formal 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

aleph₀-Categorical, aleph₀-stable structures.

Gregory L. Cherlin, Leo Harrington, Alistair H. Lachlan

Ann. Pure Appl. Log., 1985

1984

Fundamentals of forking.

Victor Harnik, Leo Harrington

Ann. Pure Appl. Log., 1984

1982

Trees, Automata, and Games

Yuri Gurevich, Leo Harrington

Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982

1980

Extensions of countable infinitary logic which preserve most of its nice properties.

Leo Harrington

Arch. Math. Log., 1980

1978

Analytic Determinacy and 0 ^#.

Leo Harrington

J. Symb. Log., 1978

Models Without Indiscernibles.

Fred G. Abramson, Leo Harrington

J. Symb. Log., 1978

1977

Meeting of the Association for Symbolic Logic: Reno, 1976.

Solomon Feferman, Jon Barwise, Leo Harrington

J. Symb. Log., 1977

1976

Selection in Abstract Recursion Theory.

Leo Harrington, David B. MacQueen

J. Symb. Log., 1976

On sigma₁ Well-Orderings of the Universe.

Leo Harrington, Thomas Jech

J. Symb. Log., 1976

Adding a Closed Unbounded Set.

James E. Baumgartner, Leo Harrington, E. M. Kleinberg

J. Symb. Log., 1976

1975

On Characterizing Spector Classes.

Leo Harrington, Alexander S. Kechris

J. Symb. Log., 1975

1974

Recursively Presentable Prime Models.

Leo Harrington

J. Symb. Log., 1974