An extension of the nondiamond theorem in classical and α-recursion theory

DOI10.2307/2274191zbMath0577.03022OpenAlexW1975441551MaRDI QIDQ3698790

Ambos-Spies, Klaus

Publication date: 1984

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

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

zbMATH Keywords

recursively enumerable degreesnoncappabilitycappable degreealpha recursion theorylow-cuppable degrees

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (5)

On definable filters in computably enumerable degrees ⋮ Cupping and noncapping in the r.e. weak truth table and turing degrees ⋮ On strongly jump traceable reals ⋮ Interpreting \(\mathbb{N}\) in the computably enumerable weak truth table degrees ⋮ Splitting theorems in recursion theory

Cites Work

• Interpolation and embedding in the recursively enumerable degrees
• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
• Degrees of Unsolvability. (AM-55)
• The Friedberg-Muchnik Theorem Re-Examined
• On suborderings of the α-recursively enumerable α-degrees
• Some minimal pairs of α-recursively enumerable degrees

This page was built for publication: An extension of the nondiamond theorem in classical and α-recursion theory