On Pairs of Recursively Enumerable Degrees

DOI10.2307/1999144zbMath0541.03023OpenAlexW4249312125MaRDI QIDQ3328534

Ambos-Spies, Klaus

Publication date: 1984

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

zbMATH Keywords

recursively enumerable degrees

Mathematics Subject Classification ID

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

Related Items (8)

Decomposition and infima in the computably enumerable degrees ⋮ Structural interactions of the recursively enumerable T- and W-degrees ⋮ Intervals and sublattices of the r.e. weak truth table degrees. I: Density ⋮ Minimal pairs in initial segments of the recursively enumerable degrees ⋮ Infima in the recursively enumerable weak truth table degrees ⋮ Towards characterizing the \(> \omega^2\)-fickle recursively enumerable Turing degrees ⋮ The distribution of the generic recursively enumerable degrees ⋮ Splitting theorems in recursion theory

Cites Work

• Interpolation and embedding in the recursively enumerable degrees
• Decomposition of Recursively Enumerable Degrees
• The infinite injury priority method
• A recursively enumerable degree which will not split over all lesser ones
• A minimal pair of recursively enumerable degrees
• Lower Bounds for Pairs of Recursively Enumerable Degrees
• On the Degrees of Index Sets. II
• Minimal Upper Bounds for Sequences of Recursively Enumerable Degrees

This page was built for publication: On Pairs of Recursively Enumerable Degrees