|
16
|
An extension of the recursively enumerable Turing degrees
– Stephen G. Simpson
- 2006
|
|
8
|
Some fundamental issues concerning degrees of unsolvability
– Stephen G. Simpson
- 2007
|
|
18
|
Mass problems and hyperarithmeticity
– Joshua A. Cole, Stephen G. Simpson
- 2006
|
|
11
|
Mass problems and almost everywhere domination
– Stephen G. Simpson
|
|
1
|
LOW UPPER BOUNDS OF IDEALS
– Antonín Kučera, Theodore, A. Slaman
|
|
11
|
Almost everywhere domination and superhighness
– Stephen G. Simpson
- 2007
|
|
49
|
Trivial Reals
– Rod G. Downey, et al.
|
|
32
|
Using random sets as oracles
– Denis R. Hirschfeldt, Frank Stephan, André Nies
|
|
2
|
Relative Randomness via RK-Reducibility
– Alexander Raichev
- 2006
|
|
|
Topics in Logic and . . .
– Stephen G. Simpson
- 2005
|
|
1
|
Computational Processes, Observers and Turing Incompleteness
– Klaus Sutner
|
|
|
Turing degrees.
– Stephen G. Simpson, Stephen G. Simpson
- 2006
|
|
17
|
Uniform almost everywhere domination
– Peter Cholak, Noam Greenberg, Joseph, S. Miller
- 2006
|
|
|
STRONG JUMP-TRACEABILITY II: K-TRIVIALITY
– Rod Downey, Noam Greenberg
- 2010
|
|
3
|
K-TRIVIAL DEGREES AND THE JUMP-TRACEABILITY HIERARCHY
– George Barmpalias, Rod Downey, Noam Greenberg
|
|
4
|
Beyond strong jump traceability
– Keng Meng Ng
|
|
20
|
Lowness properties and approximations of the jump
– Santiago Figueira, Frank Stephan
- 2006
|
|
1
|
Lowness and Π0 2 nullsets
– Rod Downey, Andre Nies, Rebecca Weber, Liang Yu
- 2006
|
|
|
CHAITIN’S HALTING PROBABILITY AND THE COMPRESSION OF STRINGS USING ORACLES
– George Barmpalias, Andrew, E. M. Lewis
|
