| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4662606 | Annals of Pure and Applied Logic | 2006 | 21 Pages |
Abstract
We study the jump hierarchy of d.c.e. Turing degrees and show that there exists a high d.c.e. degree d which does not bound any minimal pair of d.c.e. degrees.
Related Topics
Physical Sciences and Engineering
Mathematics
Logic
