On definable filters in computably enumerable degrees

Based on a result of Nies on definability of the upper semilattice of computably enumerable degrees (denoted by R ), we find that in R filters generated by definable subsets are also definable. As applications we demonstrate two new definable filters and study their supremum. Finally we demonstrate a counterexample.