The equivalence of some general combinatorial decision problems

This publication has 13 references indexed in Scilit:

• The post correspondence problem
  The Journal of Symbolic Logic, 1968
• Word Problems and Recursively Enumerable Degrees of Unsolvability. A First Paper on Thue Systems
  Annals of Mathematics, 1966
• Some ways of constructing a propositional calculus of any required degree of unsolvability
  Transactions of the American Mathematical Society, 1965
• Machine Configuration and Word Problems of Given Degree of Unsolvability
  Mathematical Logic Quarterly, 1965
• The Post-Lineal theorems for arbitrary recursively enumerable degrees of unsolvability.
  Notre Dame Journal of Formal Logic, 1965
• A complex of problems proposed by Post
  Bulletin of the American Mathematical Society, 1964
• A detailed argument for the Post-Linial theorems.
  Notre Dame Journal of Formal Logic, 1964
• The Word Problem
  Annals of Mathematics, 1959
• Recursive Unsolvability of a problem of Thue
  The Journal of Symbolic Logic, 1947
• A variant of a recursively unsolvable problem
  Bulletin of the American Mathematical Society, 1946