|
1
|
Dynamic Properties of Computably Enumerable Sets
– Leo Harrington, Robert I. Soare
- 1995
|
|
12
|
The ∆ 0 3-automorphism method and noninvariant classes of degrees
– Leo Harrington, Robert, I. Soare
- 1996
|
|
|
...-Automorphism Method and Noninvariant Classes of Degrees
– Leo Harrington, Robert, Robert I. Soare
- 1996
|
|
|
Definable properties of the computably enumerable sets
– Leo Harrington, Robert I. Soare
- 1996
|
|
1
|
An Overview of the Computably Enumerable Sets
– Robert I. Soare
|
|
|
Extensions, Automorphisms, and Definability
– Robert I. Soare
|
|
8
|
On the definability of the double jump in the computably enumerable sets
– Peter A. Cholak, Leo, A. Harrington
- 2002
|
|
5
|
Definable encodings in the computably enumerable sets
– Peter A. Cholak, Leo, A. Harrington
- 2000
|
|
2
|
The global structure of computably enumerable sets
– Peter A. Cholak
|
|
1
|
THE COMPLEXITY OF ORBITS OF COMPUTABLY ENUMERABLE SETS
– Peter A. Cholak, Rodney Downey, Leo, A. Harrington
|
|
3
|
Highness and Bounding Minimal Pairs
– Rodney G. Downey Steffen Lempp, Rodney G. Downey, Richard A. Shore
- 1993
|
|
7
|
The recursively enumerable degrees
– Richard A. Shore
- 1996
|
|
6
|
Some orbits for
– Peter Cholak, Rod Downey, Eberhard Herrmann
|
|
7
|
There is no Fat Orbit
– Rod Downey, Leo Harrington
|
|
|
TOWARD THE DEFINABILITY OF THE ARRAY NONCOMPUTABLE DEGREES
– Peter A. Cholak, Stephen M. Walk
- 1999
|
|
7
|
1995], Degree theoretic definitions of the low 2 recursively enumerable sets
– Rod Downey, Richard A. Shore
- 1995
|
|
2
|
Immunity Properties and the n-C.E. Hierarchy
– Bahareh Afshari, George Barmpalias, S. Barry Cooper
|
|
1
|
PROMPT SIMPLICITY, ARRAY COMPUTABILITY AND CUPPING
– Rod Downey, Noam Greenberg, Joseph S. Miller, Rebecca Weber
|
|
25
|
Computability and recursion
– Robert I. Soare
- 1996
|
