Abstract
A set Asubset of or equal toω is called computably enumerable , if there is an algorithm to enumerate the elements of it. For sets A,Bsubset of or equal toω, we say that A is bounded Turing reducible to reducible to) B if there is a Turing functional, Φ say, with a computable bound of oracle query bits such that A is computed by Φ equipped with an oracle B, written image. Let image be the structure of the c.e. bT-degrees, the c.e. degrees under the bounded Turing reductions. In this paper we study the continuity properties in image. We show that for any c.e. bT-degree image, there is a c.e. bT-degree image such that for any c.e. bT-degree image, image if and only if image. We prove that the analog of the Seetapun local noncappability theorem from the c.e. Turing degrees also holds in image. This theorem demonstrates that every image is noncappable with any nontrivial degree below some image