A Cappable Almost Everywhere Dominating Computably Enumerable Degree

14 years 21 days ago

We show that there exists an almost everywhere (a.e.) dominating computably enumerable (c.e.) degree which is half of a minimal pair.

George Barmpalias, Antonio Montalbán

ENTCS 2007 | Enumerable | Minimal Pair |

claim paper

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2007
Where	ENTCS
Authors	George Barmpalias, Antonio Montalbán

Comments (0)