加载中…
A Turing degree is d.c.e. if it contains a set that is the difference of two c.e. sets. A d.c.e. degree is isolated by a c.e. degree if all c.e. degrees that are below are also below ; is isolated from above by a c.e. degree if all c.e. degrees that are above are also above . In this paper, we study the inductive strength of both isolated and upper isolated d.c.e. degrees from the point of view of reverse recursion theory. We show that (1) There is an isolated proper d.c.e. degree below ; (2) There is an upper isolated proper d.c.e. degree below .

生成讲解博客的中文版本

生成AI智能校验的中文版本