Decomposition of Recursively Enumerable Degrees

DOI10.2307/2042512MaRDI QIDQ3897040zbMATH OpenOpenAlexFDO

Authors Alistair H. Lachlan

Publication date 1980

Full work available at URL https://doi.org/10.2307/2042512

zbMATH Keywords

splittingdiamondminimal pairinfinite priority

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Cites work

• A minimal pair of recursively enumerable degrees
• Lower Bounds for Pairs of Recursively Enumerable Degrees
• On the degrees less than 0'
• Recursively enumerable sets and degrees

Cited in

(12)

• The density of infima in the recursively enumerable degrees
• Splitting theorems in recursion theory
• On the problem of the critical bound
• Working below a \(low_ 2\) recursively enumerable degree
• An extended Lachlan splitting theorem
• Embeddings of N₅ and the contiguous degrees
• Intervals and sublattices of the r.e. weak truth table degrees. I: Density
• On Pairs of Recursively Enumerable Degrees
• Branching Degrees above low Degrees
• A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees preserving greatest element
• Some results about the R.E. degrees
• Structural interactions of the recursively enumerable T- and W-degrees

This page was built for publication: Decomposition of Recursively Enumerable Degrees

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