A pseudofundamental sequence that is not equivalent to any monotone sequence

DOI10.1007/BF01117484MaRDI QIDQ2557693zbMATH OpenFDO

Authors G. S. Tsejtin

Publication date 1973

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

Full work available at URL https://doi.org/10.1007/BF01117484

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3073037 (Why is no real title available?)
• 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

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