Computing degrees of unsolvability

This publication has 14 references indexed in Scilit:

• Reducibility and Completeness for Sets of Integers
  Mathematical Logic Quarterly, 1959
• Gödel numberings of partial recursive functions
  The Journal of Symbolic Logic, 1958
• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
  Proceedings of the National Academy of Sciences, 1957
• Arithmetical representation of recursively enumerable sets
  The Journal of Symbolic Logic, 1956
• Examples of sets definable by means of two and three quantifiers
  Fundamenta Mathematicae, 1955
• Creative sets
  Mathematical Logic Quarterly, 1955
• The Upper Semi-Lattice of Degrees of Recursive Unsolvability
  Annals of Mathematics, 1954
• On definable sets of positive integers
  Fundamenta Mathematicae, 1947
• Recursively enumerable sets of positive integers and their decision problems
  Bulletin of the American Mathematical Society, 1944
• Recursive predicates and quantifiers
  Transactions of the American Mathematical Society, 1943