On Suborderings of Degrees of Recursive Unsolvability
From MaRDI portal
Publication:5729297
DOI10.1002/malq.19610070109zbMath0118.25202OpenAlexW1990286579MaRDI QIDQ5729297
Publication date: 1961
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.19610070109
Related Items (17)
Computational depth and reducibility ⋮ Possible degrees in recursive copies ⋮ Turing incomparability in Scott sets ⋮ Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes ⋮ A cornucopia of minimal degrees ⋮ On the structure of the Medvedev lattice ⋮ Not every finite lattice is embeddable in the recursively enumerable degrees ⋮ Countable admissible ordinals and hyperdegrees ⋮ On the order dimension of locally countable partial orderings ⋮ The independence of control structures in abstract programming systems ⋮ Uniform Martin’s conjecture, locally ⋮ Embedding jump upper semilattices into the Turing degrees ⋮ Undecidability and 1-types in the recursively enumerable degrees ⋮ Weakly useful sequences ⋮ Unnamed Item ⋮ A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degrees ⋮ Uniformity, universality, and computability theory
This page was built for publication: On Suborderings of Degrees of Recursive Unsolvability
