Abstract
We show that there exists an almost everywhere (a.e.) dominating computably enumerable (c.e.) degree which is half of a minimal pair.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
https://doi.org/10.1016/j.entcs.2006.08.005
Publication Date: Jan 1, 2007 | |
Citations: 12 | License type: cc-by-nc-nd |
We show that there exists an almost everywhere (a.e.) dominating computably enumerable (c.e.) degree which is half of a minimal pair.
Join us for a 30 min session where you can share your feedback and ask us any queries you have