Leo Harrington

Publication Activity (10 Years)

Years Active: 1974-2017
Publications (10 Years): 2

Top Topics

Defeasible Logic

Optical Flow Fields

Multilayer Perceptron

Top Venues

Ann. Pure Appl. Log.

Computability and Complexity

Publications

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