The post correspondence problem

DOI10.2307/2270327MaRDI QIDQ5556433zbMATH OpenOpenAlexFDO

Authors Dennis Frank Cudia, W. E. Singletary

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

Cites work

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

Cited in

(3)

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

This page was built for publication: The post correspondence problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5556433)