|
|
On the Quantitative Structure of ...
– Sebastiaan A. Terwijn
- 2000
|
|
1
|
The ∀∃-theory of R(≤, ∨, ∧) is undecidable
– Russell G. Miller, Andre O. Nies, Richard, A. Shore
- 2004
|
|
2
|
A General Framework for Priority Arguments
– Steffen Lempp, Manuel Lerman, T A If
- 1995
|
|
1
|
LOW UPPER BOUNDS OF IDEALS
– Antonín Kučera, Theodore, A. Slaman
|
|
|
Lattice initial segments of the hyperdegrees
– Richard A. Shore, Bjørn Kjos-Hanssen
- 2009
|
|
1
|
THE COMPLEXITY OF ORBITS OF COMPUTABLY ENUMERABLE SETS
– Peter A. Cholak, Rodney Downey, Leo, A. Harrington
|
|
|
RESTRICTED JUMP INTERPOLATION IN THE D.C.E. DEGREES
– Carl G. Jockusch, Angsheng Li
- 2009
|
|
1
|
Turing Oracle Machines, Online Computing, and Three Displacements in Computability Theory
– Robert I. Soare
- 2009
|
|
3
|
Generalized high degrees have the complementation property
– Noam Greenberg, Antonio Montalbán, Richard, A. Shore
|
|
25
|
Computability and recursion
– Robert I. Soare
- 1996
|
|
14
|
The theory of the degrees below 0
– Richard A. Shore
- 1981
|
|
3
|
Mass problems and measure-theoretic regularity
– Stephen G. Simpson
- 2009
|
|
1
|
Computational Processes, Observers and Turing Incompleteness
– Klaus Sutner
|
|
3
|
Computability and Incomputability
– Robert I. Soare
|
|
|
Computational Processes and Incompleteness
– Klaus Sutner
- 906
|
|
47
|
An oracle builder’s toolkit
– Stephen Fenner, Lance Fortnow, Stuart A. Kurtz, Lide Li
- 2002
|
|
5
|
EMBEDDING JUMP UPPER SEMILATTICES INTO THE TURING DEGREES
– Antonio Montalbán
|
|
1
|
Global Properties of the Turing Degrees and the Turing Jump
– Theodore A. Slaman
|
