Notes on the O‴ priority method with special attention to density results
暂无分享,去创建一个
[1] Peter A. Fejer. The density of the nonbranching degrees , 1983, Ann. Pure Appl. Log..
[2] Gerald E. Sacks,et al. The Recursively Enumerable Degrees are Dense , 1964 .
[3] Richard A. Shore,et al. A non-inversion theorem for the jump operator , 1988, Ann. Pure Appl. Log..
[4] Al Young. Providence, Rhode Island , 1975 .
[5] R. Soare. Recursively enumerable sets and degrees , 1987 .
[6] A. H. Lachlan. Decomposition of recursively enumerable degrees , 1980 .
[7] A. Lachlan. A recursively enumerable degree which will not split over all lesser ones , 1976 .
[8] Alistair H. Lachlan. Bounding Minimal Pairs , 1979, J. Symb. Log..
[9] Rodney G. Downey,et al. Completely Mitotic r.e. Degrees , 1989, Ann. Pure Appl. Log..
[10] Rodney G. Downey. A Contiguous Nonbranching Degree , 1989, Math. Log. Q..
[11] Rodney G. Downey. Lattice Nonembeddings and Initial Segments of the Recursively Enumerable Degrees , 1990, Ann. Pure Appl. Log..
[12] Klaus Ambos-Spies. On pairs of recursively enumerable degrees , 1984 .