AAAAAA
Results:
1-8
|
Results: 8
Authors:
Kucera, A
Slaman, TA
Citation: A. Kucera et Ta. Slaman, Randomness and recursive enumerability, SIAM J COMP, 31(1), 2001, pp. 199-211
Authors:
Cholak, PA
Jockusch, CG
Slaman, TA
Citation: Pa. Cholak et al., On the strength of Ramsey's theorem for pairs, J SYMB LOG, 66(1), 2001, pp. 1-55
Authors:
Slaman, TA
Soare, RI
Citation: Ta. Slaman et Ri. Soare, Extension of embeddings in the computably enumerable degrees, ANN MATH, 154(1), 2001, pp. 1-43
Authors:
Shore, RA
Slaman, TA
Citation: Ra. Shore et Ta. Slaman, A splitting theorem for n-REA degrees, P AM MATH S, 129(12), 2001, pp. 3721-3728
Authors:
Coles, RJ
Downey, RG
Slaman, TA
Citation: Rj. Coles et al., Every set has a least jump enumeration, J LOND MATH, 62, 2000, pp. 641-649
Authors:
Shinoda, J
Slaman, TA
Citation: J. Shinoda et Ta. Slaman, Recursive in a generic real, J SYMB LOG, 65(1), 2000, pp. 164-172
Authors:
Shore, RA
Slaman, TA
Citation: Ra. Shore et Ta. Slaman, Defining the Turing jump, MATH RES LE, 6(5-6), 1999, pp. 711-722
Authors:
Slaman, TA
Citation: Ta. Slaman, The global structure of the Turing degrees, STUD LOGIC, 140, 1999, pp. 155-168
Risultati:
1-8
|