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

DOI10.1016/0003-4843(76)90016-4MaRDI QIDQ4128552zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(35)

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

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)