Decomposition of Recursively Enumerable Degrees
From MaRDI portal
Publication:3897040
DOI10.2307/2042512zbMath0451.03013OpenAlexW4234007101MaRDI QIDQ3897040
Publication date: 1980
Full work available at URL: https://doi.org/10.2307/2042512
Related Items
Structural interactions of the recursively enumerable T- and W-degrees, On Pairs of Recursively Enumerable Degrees, Intervals and sublattices of the r.e. weak truth table degrees. I: Density, On the problem of the critical bound, An extended Lachlan splitting theorem, Some results about the R.E. 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, Working below a \(low_ 2\) recursively enumerable degree, Embeddings of \(N_5\) and the contiguous degrees, Splitting theorems in recursion theory, The density of infima in the recursively enumerable degrees
Cites Work