On the degrees less than 0'
From MaRDI portal
Publication:2626204
DOI10.2307/1970214zbMath0118.25104OpenAlexW2070390550MaRDI QIDQ2626204
Publication date: 1963
Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1970214
Related Items
Two theorems on degrees of models of true arithmetic, Decomposition and infima in the computably enumerable degrees, Intervals and sublattices of the r.e. weak truth table degrees. I: Density, Extensions of two constructions of Ahmad, Strong enumeration reducibilities, The discontinuity of splitting in the recursively enumerable degrees, Turing incomparability in Scott sets, Lower bounds on degrees of game-theoretic structures, Bi-isolation in the d.c.e. degrees, A limit on relative genericity in the recursively enumerable sets, Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree, Decomposition of Recursively Enumerable Degrees, Nonbounding and Slaman triples, Interpolating \(d\)-r.e. and REA degrees between r.e. degrees, Initial segments of the degrees of unsolvability Part II: minimal degrees, The Quotient Semilattice of the Recursively Enumerable Degrees Modulo the Cappable Degrees, On Low for Speed Oracles, Computational processes, observers and Turing incompleteness, Sacks forcing does not always produce a minimal upper bound, How enumeration reductibility yields extended Harrington non-splitting, Not every finite lattice is embeddable in the recursively enumerable degrees, Coding true arithmetic in the Medvedev degrees of \(\Pi^0_1\) classes, Sets of real numbers closed under Turing equivalence: applications to fields, orders and automorphisms, The $\Delta ^0_2$ Turing degrees: Automorphisms and Definability, A classification of low c.e. sets and the Ershov hierarchy, 1-Generic Degrees Bounding Minimal Degrees Revisited, Nondensity of Double Bubbles in the D.C.E. Degrees, A semilattice generated by superlow computably enumerable degrees, Complementing cappable degrees in the difference hierarchy., On strongly jump traceable reals, Definable relations in Turing degree structures, The \(\omega\)-Turing degrees, Generalized nonsplitting in the recursively enumerable degrees, The density of the low\(_ 2\) \(n\)-r.e. degrees, The Sacks density theorem and Σ2-bounding, On Lachlan's major sub-degree problem, Finite injury and Σ1-induction, INTRINSIC SMALLNESS, A hierarchy for the plus cupping Turing degrees, A splitting theorem for $n-REA$ degrees, Interpreting true arithmetic in the -enumeration degrees, Incomparable prime ideals of recursively enumerable degrees, On degrees of unsolvability and complexity properties, Computably enumerable sets and related issues, Completely mitotic c.e. degrees and non-jump inversion, On low for speed oracles, A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees preserving greatest element, Bounding nonsplitting enumeration degrees, Turing computability: structural theory, Splitting in 2-computably enumerable degrees with avoiding cones, Recursively enumerable sets and degrees, Splitting and nonsplitting, II: A low2 c.e. degree above which 0′ is not splittable, Definable degrees and automorphisms of 𝒟, Jump operator and Yates Degrees, On the reducibility of \(\Pi_ 1^ 1\) sets, A non-splitting theorem in the enumeration degrees, On \(m\)-degrees of recursively enumerable sets, Extensions of embeddings below computably enumerable degrees, Degree Structures: Local and Global Investigations, The Π3-theory of the -enumeration degrees is undecidable, NON-SPLITTINGS OF SPEEDABLE SETS, On the existence of a strong minimal pair, The density of the nonbranching degrees, Definability in the Recursively Enumerable Degrees, The members of thin and minimal \(\Pi_1^0\) classes, their ranks and Turing degrees, On trees without hyperimmune branches, Splitting theorems in recursion theory, Metarecursively enumerable sets and admissible ordinals, A reducibility related to being hyperimmune-free, Non-uniformity and generalised Sacks splitting, Metarecursive sets, A splitting theorem for simple Π11 Sets, Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
