Some results about the R.E. degrees

DOI10.1007/BF02565029zbMath0641.03030OpenAlexW91910828MaRDI QIDQ3781752

Yuefei Sui

Publication date: 1987

Published in: Acta Mathematica Sinica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02565029

zbMATH Keywords

low degreeweak truth table degreesrecursively enumerable Turing degreesdual anti-cupping propertystrongly noncappable degree

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Cites Work

• Wtt-degrees and T-degrees of r.e. sets
• Bounding minimal pairs
• Decomposition of Recursively Enumerable Degrees
• Branching Degrees above low Degrees
• Minimal pairs and high recursively enumerable degrees
• The weak truth table degrees of recursively enumerable sets
• A recursively enumerable degree which will not split over all lesser ones
• Computational complexity, speedable and levelable sets
• A minimal pair of recursively enumerable degrees
• Lower Bounds for Pairs of Recursively Enumerable Degrees

This page was built for publication: Some results about the R.E. degrees