Citation: K. Ambosspies et al., CONFERENCE ON COMPUTABILITY THEORY - 27 JANUARY 3 FEBRUARY 1996 - OBERWOLFACH, GERMANY - PREFACE, Annals of pure and applied Logic, 94(1-3), 1998, pp. 1-1
Citation: L. Harrington et Ri. Soare, DEFINABLE PROPERTIES OF THE COMPUTABLY ENUMERABLE SETS, Annals of pure and applied Logic, 94(1-3), 1998, pp. 97-125
Citation: Ah. Lachlan et Ri. Soare, MODELS OF ARITHMETIC AND SUBUNIFORM BOUNDS FOR THE ARITHMETIC SETS, The Journal of symbolic logic, 63(1), 1998, pp. 59-72
Citation: L. Harrington et Ri. Soare, THE DELTA(0)(3)-AUTOMORPHISM METHOD AND NONINVARIANT CLASSES OF DEGREES, Journal of the American Mathematical Society, 9(3), 1996, pp. 617-666
Citation: Ta. Slaman et Ri. Soare, ALGEBRAIC ASPECTS OF THE COMPUTABLY ENUMERABLE DEGREES, Proceedings of the National Academy of Sciences of the United Statesof America, 92(2), 1995, pp. 617-621
Citation: Cg. Jockusch et Ri. Soare, BOOLEAN-ALGEBRAS, STONE SPACES, AND THE ITERATED TURING JUMP, The Journal of symbolic logic, 59(4), 1994, pp. 1121-1138