Splitting and Decomposition by Regressive Sets, II

Publisher Website
Google Scholar
Abstract
In (3), Dekker drew attention to an analogy between (a) the relationship of the recursive sets to the recursively enumerable sets, and (b) the relationship of the retraceable sets to the regressive sets. As was to be expected, this analogy limps in some respects. For example, if a number set α is split by a recursive set, then it is decomposed by a pair of recursively enumerable sets; whereas, as we showed in (6, Theorem 2), α may be split by a retraceable set and yet not decomposable (in a liberal sense of the latter term) by a pair of regressive sets. The result for recursive and recursively enumerable sets, of course, follows from the trivial fact that the complement of a recursive set is recursive.

This publication has 5 references indexed in Scilit: