Interpolation and embedding in the recursively enumerable degrees
From MaRDI portal
Publication:2560238
DOI10.2307/1970776zbMath0259.02033OpenAlexW2082637799MaRDI QIDQ2560238
Publication date: 1971
Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1970776
Related Items
There is no ordering on the classes in the generalized high/low hierarchies, An extension of the nondiamond theorem in classical and α-recursion theory, A hierarchy of families of recursively enumerable degrees, On Pairs of Recursively Enumerable Degrees, On definable filters in computably enumerable degrees, Non-p-generic and strongly nonbranching degree, Nonbounding and Slaman triples, Non-p-generic and strongly nonbranching degree, The density of the meet-inaccessible r. e. degrees, Not every finite lattice is embeddable in the recursively enumerable degrees, THE COMPLEMENTS OF LOWER CONES OF DEGREES AND THE DEGREE SPECTRA OF STRUCTURES, On strongly jump traceable reals, An incomplete set of shortest descriptions, Isolation from side in 2-computably enumerable degrees, Branching Degrees above low Degrees, On Lachlan's major sub-degree problem, On the structures inside truth-table degrees, Infima in the d.r.e. degrees, The distribution of the generic recursively enumerable degrees, The Halting Problem Relativized to Complements, There are no maximal low d.c.e. degrees, Turing computability: structural theory, Elementary differences among jump classes, Model-theoretic properties of Turing degrees in the Ershov difference hierarchy, Low upper bounds of ideals, Recursively enumerable sets and degrees, Computational complexity, speedable and levelable sets, Splitting and nonsplitting, II: A low2 c.e. degree above which 0′ is not splittable, T-Degrees, Jump Classes, and Strong Reducibilities, The atomic model theorem and type omitting, Definability in the Recursively Enumerable Degrees, Splitting theorems in recursion theory
