An easy priority-free proof of a theorem of Friedberg

Theory of Recursive Functions and Effective Computability.

Solomon Feferman, Hartley Rogers · American Mathematical Monthly · 1969 · 2.8K citations

Computing, Computer Science, Mathematics +14

Theory of Recursive Functions and Effective Computability

D. C. Cooper · The Computer Journal · 1969 · 2.6K citations · Full text

Computing, Computer Science, Mathematics +14

Recursively enumerable sets and degrees

Robert I. Soare · Bulletin of the American Mathematical Society · 1978 · 1.6K citations · Full text

Natural Sciences, Computer Science, Mathematics +15

TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)

R. Friedberg · Proceedings of the National Academy of Sciences · 1957 · 298 citations · Full text

Natural Sciences, Mathematics, Combinatorics +6

Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication

R. Friedberg · Journal of Symbolic Logic · 1958 · 244 citations

Natural Sciences, Computer Science, Mathematics +12