Recursively enumerable degrees and the conjugacy problem

This publication has 10 references indexed in Scilit:

• Word Problems and Recursively Enumerable Degrees of Unsolvability. A Sequel on Finitely Presented Groups
  Annals of Mathematics, 1966
• Word Problems and Recursively Enumerable Degrees of Unsolvability. A First Paper on Thue Systems
  Annals of Mathematics, 1966
• Machine Configuration and Word Problems of Given Degree of Unsolvability
  Mathematical Logic Quarterly, 1965
• Finitely Presented Groups with Word Problems of Arbitrary Degrees of Insolubility
  Proceedings of the London Mathematical Society, 1964
• The Word Problem
  Annals of Mathematics, 1963
• The equation $a^M=b^Nc^P$ in a free group.
  The Michigan Mathematical Journal, 1962
• The Word Problem
  Annals of Mathematics, 1959
• Recursive Unsolvability of Group Theoretic Problems
  Annals of Mathematics, 1958
• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
  Proceedings of the National Academy of Sciences, 1957
• Certain Simple, Unsolvable Problems of Group Theory. I1)1)Unless otherwise indicated, the results and proofs of this and subsequent related papers are as given (in somewhat more detail) in Several simple unsolvable problems of group theory related to the word problem, a doctoral dissertation accepted by Princeton University in April, 1952. The proof of the unsolvability of the quasi-MAGNUS problem was presented to a meeting of The Association for Symbolic Logic, April 28, 1951. (Abstract, Journal of Symbolic Logic, 16, 237.)Our thanks are due to Professors Alonzo Church and Roger Lyndon for their constructive suggestions regarding this dissertation; to Professor Wilhelm Magnus, for stimulating discussions regarding possible extensions.
  Indagationes Mathematicae, 1954