论文信息 - On the Theory of the Polynomial Degrees of the Recursive Sets - 字舞流文

On the Theory of the Polynomial Degrees of the Recursive Sets

Theodore A. Slaman | Juichi Shinoda | T. Slaman | Juichi Shinoda

[1] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.

[2] C. Spector. On Degrees of Recursive Unsolvability , 1956 .

[3] Theodore A. Slaman,et al. Definability in the Turing degrees , 1986 .

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

[5] R. Shore. The Theory of the Degrees below 0 , 1981 .

[6] Saharon Shelah,et al. The undecidability of the recursively enumerable degrees , 1982 .

[7] Richard E. Ladner,et al. On the Structure of Polynomial Time Reducibility , 1975, JACM.

[8] Anil Nerode,et al. Reducibility orderings: Theories, definability and automorphisms☆ , 1980 .

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