A minimal degree less than 0’
From MaRDI portal
Publication:3282934
Cites work
Cited in
(27)- Initial segments of the degrees of unsolvability Part II: minimal degrees
- Elementary differences between the degrees of unsolvability and degrees of compressibility
- Minimal predicates for -definability
- Complementing below recursively enumerable degrees
- On Σ1-Structural Differences Among Finite Levels of the Ershov Hierarchy
- A survey of results on the d.c.e. and \(n\)-c.e. degrees
- The minimal e-degree problem in fragments of Peano arithmetic
- Minimal weak truth table degrees and computably enumerable Turing degrees
- Complementing cappable degrees in the difference hierarchy.
- Extensions of embeddings below computably enumerable degrees
- \(\Pi_1^0\) classes and minimal degrees
- Turing computability: structural theory
- Lowness, Randomness, and Computable Analysis
- Ramsey's theorem and recursion theory
- Bounding minimal degrees by computably enumerable degrees
- Interpolating \(d\)-r.e. and REA degrees between r.e. degrees
- Joining up to the generalized high degrees
- Local Initial Segments of The Turing Degrees
- There exists a maximal 3-c.e. enumeration degree
- Recursively enumerable sets and degrees
- The structure of the honest polynomial m-degrees
- A basis theorem for Π₁⁰ classes of positive measure and jump inversion for random reals
- Degree Structures: Local and Global Investigations
- On Downey's conjecture
- Some contrasts between degrees and the arithmetical hierarchy
- Normalizing notations in the Ershov hierarchy
- Weak density and nondensity among transfinite levels of the Ershov hierarchy
This page was built for publication: A minimal degree less than 0’
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3282934)
