A pseudofundamental sequence that is not equivalent to any monotone sequence

DOI10.1007/BF01117484zbMath0253.02039MaRDI QIDQ2557693

G. S. Tsejtin

Publication date: 1973

Published in: Journal of Soviet Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Cites Work

• Unnamed Item
• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)

This page was built for publication: A pseudofundamental sequence that is not equivalent to any monotone sequence