Cited in
(86)- Upper bounds for the arithmetical degrees
- Honest polynomial degrees and \(P=?NP\)
- Lower bounds on degrees of game-theoretic structures
- Not every finite lattice is embeddable in the recursively enumerable degrees
- Countable admissible ordinals and hyperdegrees
- Automorphism bases for degrees of unsolvability
- The p-T-degrees of the recursive sets: Lattice embeddings, extensions of embeddings and the two-quantifier theory
- Scaling in the animal kingdom
- The structure of the honest polynomial m-degrees
- \(\Pi_1^0\) classes and minimal degrees
- An oracle builder's toolkit
- Quasi-minimal enumeration degrees and minimal Turing degrees
- The Turing closure of an Archimedean field
- Lattice nonembeddings and intervals of the recursively enumerable degrees
- Initial segments of the degrees of size \(\aleph _ 1\)
- On trees without hyperimmune branches
- Transducer degrees: atoms, infima and suprema
- Minimal predicates for -definability
- There exists a maximal 3-c.e. enumeration degree
- Arithmetical Sacks forcing
- On the strength of Ramsey's theorem for pairs
- On the structures inside truth-table degrees
- Measure and cupping in the Turing degrees
- Low level nondefinability results: domination and recursive enumeration
- Weakly represented families in reverse mathematics
- Lowness, Randomness, and Computable Analysis
- Complementation in the Turing degrees
- Forcing and reducibilities
- Decomposition and infima in the computably enumerable degrees
- Measure-theoretic construction of incomparable hyperdegrees
- A minimal degree less than 0’
- Hyperarithmetical Sets
- Degree Structures: Local and Global Investigations
- Degrees of transducibility
- Structures of some strong reducibilities
- A single minimal complement for the c.e. degrees
- Cohen and Set Theory
- Lowness for Kurtz randomness
- Jumps of quasi-minimal enumeration degrees
- Degrees bounding minimal degrees
- On the upper semi-lattice of -degrees
- Systems of notations and the ramified analytical hierarchy
- Minimal degrees and the jump operator
- Minimal Covers and Hyperdegrees
- A survey of partial degrees
- Minimal α-recursion theoretic degrees
- Noninitial segments of the α-degrees
- The decision problem for recursively enumerable degrees
- Recursively enumerable sets and degrees
- Closed choice and a uniform low basis theorem
- An application of Σ40 determinacy to the degrees of unsolvability
- Local Initial Segments of The Turing Degrees
- On a problem of Cooper and Epstein
- 2000 Annual Meeting of the Association for Symbolic Logic
- A Galois connection between Turing jumps and limits
- On minimal pairs of enumeration degrees
- The ∀∃-theory of ℛ(≤,∨,∧) is undecidable
- The Mathematical Work of S.C.Kleene
- Genericity for Mathias forcing over general Turing ideals
- The Σ 2 theory of D h ( ⩽ h O ) as an uppersemilattice with least and greatest element is decidable
- Minimal weak truth table degrees and computably enumerable Turing degrees
- Lattice initial segments of the hyperdegrees
- Undecidability and initial segments of the (r.e.) tt-degrees
- A WEAKLY 2-GENERIC WHICH BOUNDS A MINIMAL DEGREE
- Degrees of unsolvability of continuous functions
- Classes of Polish spaces under effective Borel isomorphism
- On the notational independence of various hierarchies of degrees of unsolvability
- La théorie des fonctions récursives et ses applications. (Exposé d'information générale)
- Untersuchungen über die Struktur des Kleene-Postschen Halbverbandes der Grade der Rekursiven Unlösbarkeit
- Some nondistributive lattices as initial segments of the degrees of unsolvability
- Minimal Covers and Arithmetical Sets
- A note on the hyperarithmetical hierarchy
- On initial segments of hyperdegrees
- A cornucopia of minimal degrees
- Initial segments of the degrees of unsolvability Part II: minimal degrees
- Hierarchies in Recursive Function Theory
- Recursive Enumerability and the Jump Operator
- The theory of the degrees is undecidable
- Direct construction of Scott ideals
- Generic degrees are complemented
- A discrete linear order with non-dense punctual degrees
- The minimal e-degree problem in fragments of Peano arithmetic
- On the theory of the PTIME degrees of the recursive sets
- Empty intervals in the enumeration degrees
- Computing degrees of unsolvability
- Honest polynomial time reducibilities and the \(P=?NP\) problem
This page was built for publication: On degrees of recursive unsolvability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q768100)
