Geodesic
Splitting and Decomposition by Regressive Sets, II
Canadian journal of mathematics, Tome 19 (1967) no. 1, pp. 291-311

Voir la notice de l'article provenant de la source Cambridge University Press

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. 
McLaughlin, T. G. Splitting and Decomposition by Regressive Sets, II. Canadian journal of mathematics, Tome 19 (1967) no. 1, pp. 291-311. doi: 10.4153/CJM-1967-021-3
@article{10_4153_CJM_1967_021_3,
     author = {McLaughlin, T. G.},
     title = {Splitting and {Decomposition} by {Regressive} {Sets,} {II}},
     journal = {Canadian journal of mathematics},
     pages = {291--311},
     year = {1967},
     volume = {19},
     number = {1},
     doi = {10.4153/CJM-1967-021-3},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1967-021-3/}
}
TY  - JOUR
AU  - McLaughlin, T. G.
TI  - Splitting and Decomposition by Regressive Sets, II
JO  - Canadian journal of mathematics
PY  - 1967
SP  - 291
EP  - 311
VL  - 19
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CJM-1967-021-3/
DO  - 10.4153/CJM-1967-021-3
ID  - 10_4153_CJM_1967_021_3
ER  - 
%0 Journal Article
%A McLaughlin, T. G.
%T Splitting and Decomposition by Regressive Sets, II
%J Canadian journal of mathematics
%D 1967
%P 291-311
%V 19
%N 1
%U http://geodesic.mathdoc.fr/articles/10.4153/CJM-1967-021-3/
%R 10.4153/CJM-1967-021-3
%F 10_4153_CJM_1967_021_3

[1] 1. Appel, K. I., No recursively enumerable set is the union of finitely many immune retraceable sets, to appear. Google Scholar

[2] 2. Appel, K. I. and McLaughlin, T. G., On properties of regressive sets, Trans. Amer. Math. Soc., 115 (1965), 83–93. Google Scholar

[3] 3. Dekker, J. C. E., Infinite series of isols, Proc. Symposia in Pure Math., 5 (1962), 77–96. Google Scholar

[4] 4. Dekker, J. C. E. and Myhill, J., Retraceable sets, Can. J. Math., 10 (1958), 357–373. Google Scholar

[5] 5. McLaughlin, T. G., Some remarks on extensibility, confluence of paths, branching properties, and index sets, for certain recursively enumerable graphs, to appear. Google Scholar

[6] 6. McLaughlin, T. G., Splitting and decomposition by regressive sets, Michigan Math. J., 12 (1965), 499–505. Google Scholar

[7] 7. McLaughlin, T. G., Co-immune retraceable sets, Bull. Amer. Math. Soc., 71 (1965), 523–525. Google Scholar

[8] 8. Sacks, G. E., Degrees of unsolvability, Ann. Math. Study No. 55 (Princeton, 1963). Google Scholar

Cité par Sources :