#### Filter Results:

- Full text PDF available (15)

#### Publication Year

1974

2017

- This year (2)
- Last 5 years (2)
- Last 10 years (6)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Armando Solar Lezama, Armando Solar-Lezama, Sanjit Seshia, Leo Harrington
- 2008

Program Synthesis by Sketching by Armando Solar-Lezama Doctor in Philosophy in Engineering-Electrical Engineering and Computer Science University of California, Berkeley Rastislav Bodik, Chair The goal of software synthesis is to generate programs automatically from highlevel speci cations. However, e cient implementations for challenging programs require a… (More)

- L Harrington, R I Soare
- Proceedings of the National Academy of Sciences…
- 1991

A set A of nonnegative integers is recursively enumerable (r.e.) if A can be computably listed. It is shown that there is a first-order property, Q(X), definable in E, the lattice of r.e. sets under inclusion, such that (i) if A is any r.e. set satisfying Q(A) then A is nonrecursive and Turing incomplete and (ii) there exists an r.e. set A satisfying Q(A).… (More)

- Yuri Gurevich, Leo Harrington
- STOC
- 1982

In 1969 Rabin introduced tree automata and proved one of the deepest decidability results. If you worked on decision problems you did most probably use Rabin's result. But did you make your way through Rabin's cumbersome proof with its induction on countable ordinals? Building on ideas of our predecessors-&-mdash;and especially those of… (More)

A set A of nonnegative integers is computably enumerable (c.e.),<lb>also called recursively enumerable (r.e.), if there is a computable method to<lb>list its elements. Let E denote the structure of the computably enumerable sets<lb>under inclusion, E =<lb>({We}e∈ω ,⊆). Most previously known automorphisms<lb>Φ of the structure E of sets were effective… (More)

- Leo Harrington
- J. Symb. Log.
- 1974

- Leo Harrington
- J. Symb. Log.
- 1978

- Fred G. Abramson, Leo Harrington
- J. Symb. Log.
- 1978

- S. Barry Cooper, Leo Harrington, Alistair H. Lachlan, Steffen Lempp, Robert I. Soare
- Ann. Pure Appl. Logic
- 1991

- Leo Harrington, Saharon Shelah
- Notre Dame Journal of Formal Logic
- 1985

- Peter Cholak, Leo Harrington
- Bulletin of Symbolic Logic
- 2000

The purpose of this communication is to announce some recent results on the computably enumerable sets. There are two disjoint sets of results; the first involves invariant classes and the second involves automorphisms of the computably enumerable sets. What these results have in common is that the guts of the proofs of these theorems uses a new form of… (More)