Almost computably enumerable families of sets
ISKANDER SH. KALIMULLIN · Sbornik Mathematics · 2008
An almost computably enumerable family that is not -computably enumerable is constructed. Moreover, it is established that for any computably enumerable (c.e.) set there exists a family that is -c.e. if and only if the set is not -computable.Bibliography: 5 titles.