On Suborderings of Degrees of Recursive Unsolvability
From MaRDI portal
Cited in
(18)- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
- Not every finite lattice is embeddable in the recursively enumerable degrees
- Countable admissible ordinals and hyperdegrees
- The independence of control structures in abstract programming systems
- A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degrees
- Computational depth and reducibility
- Weakly useful sequences
- Possible degrees in recursive copies
- On the structure of the Medvedev lattice
- Embedding jump upper semilattices into the Turing degrees
- On the order dimension of locally countable partial orderings
- Uniform Martin's conjecture, locally
- Uniformity, universality, and computability theory
- Turing incomparability in Scott sets
- A cornucopia of minimal degrees
- scientific article; zbMATH DE number 3424005 (Why is no real title available?)
- Undecidability and 1-types in the recursively enumerable degrees
- Part 1 of Martin's conjecture for order-preserving and measure-preserving functions
This page was built for publication: On Suborderings of Degrees of Recursive Unsolvability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5729297)
