Hartley Rogers

发表

Theory of recursive functions and effective computability (Reprint from 1967)

Hartley Rogers, 1987 .

Friedberg R. M.. Two recursively enumerable sets of incomparable degrees of unsolvability (solution of Post's problem, 1944). Proceedings of the National Academy of Sciences of the United States of America , vol. 43 (1957), pp. 236–238.

Hartley Rogers, 1958 .

Gödel numberings of partial recursive functions

Hartley Rogers, H. Rogers, 1958, Journal of Symbolic Logic.

Recursive functions over well ordered partial orderings

Hartley Rogers, 1959 .

Computing degrees of unsolvability

Hartley Rogers, 1959 .

Certain Logical Reduction and Decision Problems

Hartley Rogers, H. Rogers, 1956 .

Theory of Recursive Functions and Effective Computability

R. L. Goodstein, Hartley Rogers, 1969 .

Constructive versions of ordinal number classes

Hartley Rogers, Donald L. Kreider, H. Rogers, 1961 .

Review: S. C. Kleene, Emil L. Post, The Upper Semi-Lattice of Degrees of Recursive Unsolvability

Hartley Rogers, 1956 .