论文信息 - A Refinement of Low n and High n for the R.E. Degrees - 字舞流文

A Refinement of Low n and High n for the R.E. Degrees

Jeanleah Mohrherr

[1] Gerald E. Sacks,et al. Recursive enumerability and the jump operator , 1963 .

[2] S. S. Marchenkov. The existence of recursively enumerable minimal truth-tabular degrees , 1975 .

[3] Jeanleah Mohrherr,et al. DENSITY OF A FINAL SEGMENT OF THE TRUTH-TABLE DEGREES , 1984 .

[4] Robert I. Soare,et al. The infinite injury priority method , 1976, Journal of Symbolic Logic.

[5] Emil L. Post,et al. The Upper Semi-Lattice of Degrees of Recursive Unsolvability , 1954 .

[6] R. Soare. Recursively enumerable sets and degrees , 1987 .

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