In her 1990 thesis, Ahmad showed that there is a so-called “Ahmad pair”, i.e., there are incomparable
-enumeration degrees
and
such that every enumeration degree
is
. At the same time, she also showed that there is no “symmetric Ahmad pair”, i.e., there are no incomparable
-enumeration degrees
and
such that every enumeration degree
is
and such that every enumeration degree
is
.
In this paper, we first present a direct proof of Ahmad’s second result. We then show that her first result cannot be extended to an “Ahmad triple”, i.e., there are no
-enumeration degrees
,
and
such that both
and
are an Ahmad pair. On the other hand, there is a “weak Ahmad triple”, i.e., there are pairwise incomparable
-enumeration degrees
,
and
such that every enumeration degree
is also
or
; however neither
nor
is an Ahmad pair.