Hostname: page-component-7b7567c8c-48dgx Total loading time: 0 Render date: 2026-11-18T06:02:13.015Z Has data issue: false hasContentIssue false

Splitting and Decomposition by Regressive Sets, II

Published online by Cambridge University Press:  20 November 2018

T. G. McLaughlin*
Affiliation:
University of Illinois, Urbana, III
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1967