AAAAAA
Results:
1-7
|
Results: 7
Authors:
CHOLAK P
Citation: P. Cholak, THE DENSE SIMPLE SETS ARE ORBIT COMPLETE WITH RESPECT TO THE SIMPLE SETS, Annals of pure and applied Logic, 94(1-3), 1998, pp. 37-44
Authors:
ASH CJ
CHOLAK P
KNIGHT JF
Citation: Cj. Ash et al., PERMITTING, FORCING, AND COPYING OF A GIVES RECURSIVE RELATION, Annals of pure and applied Logic, 86(3), 1997, pp. 219-236
Authors:
CHOLAK P
Citation: P. Cholak, AUTOMORPHISMS OF THE LATTICE OF RECURSIVELY-ENUMERABLE SETS, Memoirs of the American Mathematical Society, 113(541), 1995, pp. 3
Authors:
CHOLAK P
DOWNEY R
Citation: P. Cholak et R. Downey, RECURSIVELY-ENUMERABLE M-DEGREES AND TT-DEGREES .3. REALIZING ALL FINITE DISTRIBUTIVE LATTICES, Journal of the London Mathematical Society, 50, 1994, pp. 440-453
Authors:
CHOLAK P
DOWNEY R
Citation: P. Cholak et R. Downey, PERMUTATIONS AND PRESENTATIONS, Proceedings of the American Mathematical Society, 122(4), 1994, pp. 1237-1249
Authors:
CHOLAK P
DOWNEY R
Citation: P. Cholak et R. Downey, LATTICE NONEMBEDDINGS AND INTERVALS OF THE RECURSIVELY-ENUMERABLE DEGREES, Annals of pure and applied Logic, 61(3), 1993, pp. 195-221
Authors:
CHOLAK P
DOWNEY R
Citation: P. Cholak et R. Downey, ON THE CANTOR-BENDIXON RANK OF RECURSIVELY-ENUMERABLE SETS, The Journal of symbolic logic, 58(2), 1993, pp. 629-640
Risultati:
1-7
|