论文信息 - Admissible ordinals and priority arguments - 字舞流文

Admissible ordinals and priority arguments

[1] Robert I. Soare,et al. A Minimal Pair of $\Pi^0_1$ Classes , 1971 .

[2] Richard M. Friedberg,et al. Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication , 1958, Journal of Symbolic Logic.

[3] Gerald E. Sacks,et al. POST'S PROBLEM, ADMISSIBLE ORDINALS, AND REGULARITY , 1966 .

[4] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .

[5] Alistair H. Lachlan,et al. Lower Bounds for Pairs of Recursively Enumerable Degrees , 1966 .

[6] C. E. M. Yates. A Minimal Pair of Recursively Enumerable Degrees , 1966, J. Symb. Log..

[7] R. Friedberg,et al. TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944). , 1957, Proceedings of the National Academy of Sciences of the United States of America.