We investigate the relationship of (jumps of) the degrees of splitting
s of a computably enumerable set and the degree of the set. We prove t
hat there is a high computably enumerable set whose only proper splitt
ings are low(2). (C) 1998 Elsevier Science B.V. All rights reserved.