The recursively enumerable α-degrees are dense
暂无分享，去创建一个
[1] R. Shore. Σ n sets which are Δ n -incomparable (uniformly) , 1974, Journal of Symbolic Logic.
[2] Manuel Lerman,et al. Maximal -r.e. sets , 1974 .
[3] Manuel Lerman,et al. On suborderings of the α-recursively enumerable α-degrees , 1972 .
[4] S. G. Simpson,et al. The α-finite injury method , 1972 .
[5] Manuel Lerman,et al. Some minimal pairs of α-recursively enumerable degrees , 1972 .
[6] Richard A. Shore,et al. Minimal a-degrees , 1972 .
[7] R. Jensen,et al. The fine structure of the constructible hierarchy , 1972 .
[8] Graham C. Driscoll. Metarecursively enumerable sets and their metadegrees , 1968, Journal of Symbolic Logic.
[9] G. Sacks. Degrees of unsolvability , 1965 .
[10] Gerald E. Sacks,et al. The Recursively Enumerable Degrees are Dense , 1964 .
[11] Gaisi Takeuti,et al. On the recursive functions of ordinal numbers , 1960 .
[12] Joseph R. Shoenfield,et al. Degrees of unsolvability , 1959, North-Holland mathematics studies.
[13] S. G. Simpson. Admissible ordinals and recursion theory , 1971 .
[14] R. Platek. Foundations of recursion theory , 1966 .
[15] Gerald E. Sacks,et al. POST'S PROBLEM, ADMISSIBLE ORDINALS, AND REGULARITY , 1966 .