The post correspondence problem

DOI10.2307/2270327zbMath0169.31105OpenAlexW1992652529MaRDI QIDQ5556433

W. E. Singletary, Dennis Frank Cudia

Publication date: 1968

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2270327

zbMATH Keywords

recursion theory, constructive mathematics

Related Items (3)

The equivalence of some general combinatorial decision problems ⋮ The many-one equivalence of some general combinatorial decision problems ⋮ Combinatorial systems defined over one- and two-letter alphabets

Cites Work

• Word problems and recursively enumerable degrees at unsolvability. A first paper on Thue systems
• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
• A Remark on Post Normal Systems
• Partial results regarding word problems and recursively enumerable degrees of unsolvability
• Formal Reductions of the General Combinatorial Decision Problem
• Recursively enumerable sets of positive integers and their decision problems
• A variant of a recursively unsolvable problem
• The word problem

This page was built for publication: The post correspondence problem