In this work we consider isolation from side in different degree structures, in particular, in the 2-computably enumerable wtt-degrees and in low Turing degrees. Intuitively, a 2-computably enumerable degree is isolated from side if all computably enumerable degrees from its lower cone are bounded from above by some computably enumerable degree which is incomparable with the given one. It is proved that any properly 2-computably enumerable wtt-degree is isolated from side by some computable enumerable wtt-degree. Also it is shown that the same result holds for the low 2-computable enumerable Turing degrees.

中文翻译：

---

2个可数度从侧面隔离

在这项工作中，我们考虑了不同程度的结构从一侧的隔离，特别是在2 computably枚举WTT -degrees和低图灵度。直觉上，如果从其下锥体开始的所有可计算的度数都从上方以一个与给定值不可比的可计算的度数来限定，则从侧面隔离一个2可计算的度数。事实证明，任何可适当计算的2可枚举的度数都是通过可计算的可枚举度数从侧面隔离的。还显示出相同的结果适用于低2可计算的可数图灵度。