z-logo
open-access-imgOpen Access
A Cappable Almost Everywhere Dominating Computably Enumerable Degree
Author(s) -
George Barmpalias,
Antonio Montalbán
Publication year - 2007
Publication title -
electronic notes in theoretical computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.242
H-Index - 60
ISSN - 1571-0661
DOI - 10.1016/j.entcs.2006.08.005
Subject(s) - mathematics , degree (music) , almost everywhere , existential quantification , discrete mathematics , combinatorics , physics , acoustics
We show that there exists an almost everywhere (a.e.) dominating computably enumerable (c.e.) degree which is half of a minimal pair

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom