- 1-presentations of algebras Bakhadyr Khoussainov
- RANDOMNESS AND RECURSIVE ENUMERABILITY ANTONIN KUCERA AND THEODORE A. SLAMAN
- Aspects of the Turing Jump Theodore A. Slaman
- A SPLITTING THEOREM FOR n -REA DEGREES RICHARD A. SHORE AND THEODORE A. SLAMAN
- The theory of D(, , ) is undecidable Richard A. Shore
- LOW UPPER BOUNDS OF IDEALS ANTONIN KUCERA AND THEODORE A. SLAMAN
- THE STRENGTH OF SOME COMBINATORIAL PRINCIPLES RELATED TO
- An Almost Deep Degree Peter Cholak
- ON EXTENSIONS OF EMBEDDINGS INTO THE ENUMERATION DEGREES OF THE 0
- On Turing Reducibility Marcia J. Groszek
- THE THEORY OF THE DEGREES IS UNDECIDABLE C. T. CHONG AND THEODORE A. SLAMAN
- Global Properties of the Turing Degrees and the Turing Jump
- Generating Sets for the Recursively Enumerable Turing Degrees
- PROBABILITY MEASURES AND EFFECTIVE RANDOMNESS JAN REIMANN AND THEODORE A. SLAMAN
- Some results on effective randomness (Preliminary version September 2003)
- COMPARING DNR AND WWKL KLAUS AMBOS-SPIES, BJRN KJOS-HANSSEN, STEFFEN LEMPP, AND THEODORE A.
- Notre Dame Journal of Formal Logic Differences Between Resource Bounded Degree
- ON THE STRENGTH OF RAMSEY'S THEOREM FOR PETER A. CHOLAK, CARL G. JOCKUSCH, JR., AND
- 2 INDUCTION AND INFINITE INJURY PRIORITY ARGUMENTS, PART III: PROMPT SETS, MINIMAL
- A NONLOW2 C.E. DEGREE WHICH BOUNDS NO DIAMOND BASES
- RECURSIVE IN A GENERIC REAL JUICHI SHINODA AND THEODORE A. SLAMAN
- Contemporary Mathematics Recursion Theory in Set Theory
- ON A QUESTION OF SIERPI NSKI THEODORE A. SLAMAN
- A Basis Theorem for Perfect Sets Marcia J. Groszek
- n-Bounding and n-Induction Theodore A. Slaman
- Every set has a least jump enumeration Richard J. Coles
