On a Problem of G. E. Sacks

DOI10.2307/2035595zbMath0156.00906OpenAlexW4236250994MaRDI QIDQ5537364

Alistair H. Lachlan

Publication date: 1965

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

zbMATH Keywords

mathematical logic

Related Items

The \(\omega\)-Turing degrees ⋮ Elementary differences among jump classes ⋮ Recursively enumerable sets and degrees

Cites Work

• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
• Degrees of Unsolvability. (AM-55)