Intervals containing exactly one c.e. degree

DOI10.1016/j.apal.2007.01.002zbMath1115.03043OpenAlexW1986723784MaRDI QIDQ876386

Guohua Wu

Publication date: 18 April 2007

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2007.01.002

zbMATH Keywords

recursively enumerable degreesbi-isolating degrees

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weak density and cupping in the d-r.e. degrees
• The d.r.e. degrees are not dense
• The recursively enumerable degrees are dense
• Complementation in the Turing degrees
• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
• D.R.E. Degrees and the Nondiamond Theorem
• The weak truth table degrees of recursively enumerable sets
• The strong anticupping property for recursively enumerable degrees
• Strong Minimal Covers for Recursively Enumerable Degrees
• Bi-isolation in the d.c.e. degrees
• A minimal pair of recursively enumerable degrees
• Lower Bounds for Pairs of Recursively Enumerable Degrees
• Systems of Logic Based on Ordinals^†

This page was built for publication: Intervals containing exactly one c.e. degree