Intervals containing exactly one c.e. degree

DOI10.1016/J.APAL.2007.01.002zbMATH Open1115.03043OpenAlexW1986723784MaRDI QIDQ876386FDOQ876386

Authors: 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

Recommendations

• Bi-isolation in the d.c.e. degrees
• Isolated d.r.e. degrees are dense in r.e. degree structure
• An Interval of Computably Enumerable Isolating Degrees
• On the density of the pseudo-isolated degrees
• Isolation and the high/low hierarchy

zbMATH Keywords

recursively enumerable degreesbi-isolating degrees

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

• Bi-isolation in the d.c.e. degrees
• Isolation in the CEA hierarchy

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

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