A recursively enumerable degree which will not split over all lesser ones

Cited In (35)

On strongly jump traceable reals
Recursively enumerable $m$- and $tt$-degrees. II: The distribution of singular degrees
Formalism and intuition in computability
The density of the nonbranching degrees
Total Degrees and Nonsplitting Properties of $\Sigma_2^0$ Enumeration Degrees
A non-inversion theorem for the jump operator
Splitting theorems in recursion theory
Modulo computably enumerable degrees by cupping partners
There are no maximal low d.c.e. degrees
The Role of True Finiteness in the Admissible Recursively Enumerable Degrees
The d.r.e. degrees are not dense
Elementary differences among jump classes
THE THEORY OF THE METARECURSIVELY ENUMERABLE DEGREES
Mass problems and density
Turing computability: structural theory
Strong reducibilities
On definable filters in computably enumerable degrees
Nonbounding and Slaman triples
Model-theoretic properties of Turing degrees in the Ershov difference hierarchy
On the existence of a strong minimal pair
Splitting and nonsplitting in the $\Sigma_2^0$ enumeration degrees
A non-splitting theorem in the enumeration degrees
On Pairs of Recursively Enumerable Degrees
Intervals and sublattices of the r.e. weak truth table degrees. I: Density
Recursively enumerable sets and degrees
Incomparable prime ideals of recursively enumerable degrees
NON-SPLITTINGS OF SPEEDABLE SETS
Branching Degrees above low Degrees
A splitting theorem for $n$-REA degrees
Some results about the R.E. degrees
The undecidability of the recursively enumerable degrees
On Lachlan's major sub-degree problem
A non-splitting theorem for d.r.e. sets
The ∀∃-theory of ℛ(≤,∨,∧) is undecidable
The jump is definable in the structure of the degrees of unsolvability

This page was built for publication: A recursively enumerable degree which will not split over all lesser ones

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4128552)