Abstract#R##N##R##N#We prove that there exists a nonzero recursively enumerable Turing degree possessing a strong minimal cover.#R##N##R##N##R##N##R##N#Mathematics Subject Classification: 03D30.
['S. Barry Cooper']
Strong Minimal Covers for Recursively Enumerable Degrees