|
|
...-Automorphism Method and Noninvariant Classes of Degrees
– Leo Harrington, Robert, Robert I. Soare
- 1996
|
|
12
|
The ∆ 0 3-automorphism method and noninvariant classes of degrees
– Leo Harrington, Robert, I. Soare
- 1996
|
|
3
|
Conjectures and Questions from Gerald Sacks’s Degrees of Unsolvability
– Richard A. Shore
- 1993
|
|
4
|
Degrees of Computing and Learning
– Frank Stephan
- 1999
|
|
|
965 AGENDA
– Artley Rogers Agenda, Artley Rogers, Leeds Ls Jt, S. Barry Cooper, S. Barry Cooper
|
|
3
|
Highness and Bounding Minimal Pairs
– Rodney G. Downey Steffen Lempp, Rodney G. Downey, Richard A. Shore
- 1993
|
|
3
|
On the Universal Splitting Property
– Rod Downey
- 1996
|
|
1
|
Dynamic Properties of Computably Enumerable Sets
– Leo Harrington, Robert I. Soare
- 1995
|
|
1
|
THE COMPLEXITY OF ORBITS OF COMPUTABLY ENUMERABLE SETS
– Peter A. Cholak, Rodney Downey, Leo, A. Harrington
|
|
1
|
PROMPT SIMPLICITY, ARRAY COMPUTABILITY AND CUPPING
– Rod Downey, Noam Greenberg, Joseph S. Miller, Rebecca Weber
|
|
2
|
Atomless r-Maximal Sets
– Peter A. Cholak, André Nies
|
|
2
|
The global structure of computably enumerable sets
– Peter A. Cholak
|
|
1
|
AUTOMORPHISMS OF THE LATTICE OF �0 1 CLASSES; PERFECT THIN CLASSES AND ANC DEGREES
– Peter Cholak, Richard Coles, Rod Downey, Eberhard Herrmann
|
|
13
|
Automorphisms of the lattice of Π 0 1 classes: perfect thin classes and anc degrees
– Peter Cholak, Richard Coles, Rod Downey, Eberhard Herrmann
|
|
4
|
Extension theorems, orbits, and automorphisms of the computably enumerable sets
– Peter A. Cholak, Leo, A. Harrington
- 1992
|
|
6
|
Some orbits for
– Peter Cholak, Rod Downey, Eberhard Herrmann
|
|
8
|
On the definability of the double jump in the computably enumerable sets
– Peter A. Cholak, Leo, A. Harrington
- 2002
|
|
4
|
Isomorphisms Of Splits Of 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
|
