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

DOI10.1016/0003-4843(76)90016-4zbMath0357.02040OpenAlexW2033957959MaRDI QIDQ4128552

Alistair H. Lachlan

Publication date: 1976

Published in: Annals of Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0003-4843(76)90016-4

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (35)

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

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