|
2
|
2004], The 89-theory of R( ; _; ^) is undecidable
– Andre O. Nies, Richard A. Shore
|
|
1
|
Abstract
– Cristopher Moore, Alexander Russell
|
|
2
|
The ∀∃ theory of D(≤, ∨, ′ ) is undecidable
– Richard A. Shore, Theodore A. Slaman
- 2003
|
|
3
|
Conjectures and Questions from Gerald Sacks’s Degrees of Unsolvability
– Richard A. Shore
- 1993
|
|
4
|
Degree structures: Local and global investigations
– Richard A. Shore
|
|
30
|
Parameter Definability in the Recursively Enumerable Degrees
– Andre Nies
|
|
7
|
The recursively enumerable degrees
– Richard A. Shore
- 1996
|
|
|
Computational Processes and Incompleteness
– Klaus Sutner
- 906
|
|
1
|
Computational Processes, Observers and Turing Incompleteness
– Klaus Sutner
|
|
1
|
Extension of embeddings in the recursively enumerable degrees
– Theodore A. Slaman, Robert I. Soare
|
|
14
|
The theory of the degrees below 0
– Richard A. Shore
- 1981
|
|
1
|
Global Properties of the Turing Degrees and the Turing Jump
– Theodore A. Slaman
|
|
2
|
On Lachlan's major subdegree problem, to
– S. Barry Cooper, Leeds Ls Jt, Angsheng Li
- 1989
|
|
2
|
Splitting and Nonsplitting, II: A Low_2 C.E. Degree Above Which 0' Is Not Splittable
– S. Barry Cooper, Angsheng Li
- 2001
|
|
1
|
Superbranching degrees
– Rod Downey
- 1990
|
|
22
|
Enumeration Reducibility, Nondeterministic Computations and Relative . . .
– S. Barry Cooper
- 1990
|
|
|
TOWARD THE DEFINABILITY OF THE ARRAY NONCOMPUTABLE DEGREES
– Peter A. Cholak, Stephen M. Walk
- 1999
|
|
13
|
On Presentations of Algebraic Structures
– Rod Downey
- 1995
|
|
4
|
Double Jump Inversions and Strong Minimal Covers in the Turing Degrees
– Yuval Gabay
- 2004
|
