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