A minimal degree less than 0’
From MaRDI portal
Publication:3282934
DOI10.1090/S0002-9904-1961-10652-6zbMath0101.01202MaRDI QIDQ3282934
Publication date: 1961
Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)
Related Items
Bounding minimal degrees by computably enumerable degrees ⋮ The structure of the honest polynomial m-degrees ⋮ Complementing below recursively enumerable degrees ⋮ There exists a maximal 3-c.e. enumeration degree ⋮ \(\Pi_1^0\) classes and minimal degrees ⋮ Interpolating \(d\)-r.e. and REA degrees between r.e. degrees ⋮ Initial segments of the degrees of unsolvability Part II: minimal degrees ⋮ Some contrasts between degrees and the arithmetical hierarchy ⋮ Normalizing notations in the Ershov hierarchy ⋮ Minimal Weak Truth Table Degrees and Computably Enumerable Turing Degrees ⋮ Elementary differences between the degrees of unsolvability and degrees of compressibility ⋮ Lowness, Randomness, and Computable Analysis ⋮ Ramsey's theorem and recursion theory ⋮ Minimal predicates for \(\Delta \)-definability ⋮ Complementing cappable degrees in the difference hierarchy. ⋮ A basis theorem for Π₁⁰ classes of positive measure and jump inversion for random reals ⋮ Weak density and nondensity among transfinite levels of the Ershov hierarchy ⋮ On Downey's conjecture ⋮ Joining up to the generalized high degrees ⋮ A survey of results on the d.c.e. and \(n\)-c.e. degrees ⋮ The minimal e-degree problem in fragments of Peano arithmetic ⋮ Turing computability: structural theory ⋮ Local Initial Segments of The Turing Degrees ⋮ Recursively enumerable sets and degrees ⋮ Extensions of embeddings below computably enumerable degrees ⋮ Degree Structures: Local and Global Investigations ⋮ On Σ1-Structural Differences Among Finite Levels of the Ershov Hierarchy
Cites Work
