×
McLaughlin, T. G.

A theorem on intermediate reducibilities. (English) Zbl 0295.02024

Proc. Am. Math. Soc. 19, 87-90 (1968).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0295.02024

Cited in 1 Document

MSC:

03D25 Recursively (computably) enumerable sets and degrees
Cite Review PDF
Full Text: DOI

References:

[1] Richard M. Friedberg and Hartley Rogers Jr., Reducibility and completeness for sets of integers, Z. Math. Logik Grundlagen Math. 5 (1959), 117 – 125. · Zbl 0108.00602
[2] S. C. Kleene and Emil L. Post, The upper semi-lattice of degrees of recursive unsolvability, Ann. of Math. (2) 59 (1954), 379 – 407. · Zbl 0057.24703 · doi:10.2307/1969708
[3] A. H. Lachlan, Some notions of reducibility and productiveness, Z. Math. Logik Grundlagen Math. 11 (1965), 17 – 44. · Zbl 0158.25101
[4] T. G. McLaughlin, On relative coimmunity, Pacific J. Math. 15 (1965), 1319 – 1327. · Zbl 0224.02033
[5] Emil L. Post, Recursively enumerable sets of positive integers and their decision problems, Bull. Amer. Math. Soc. 50 (1944), 284 – 316. · Zbl 0063.06328
[6] Paul R. Young, On semi-cylinders, splinters, and bounded-truth-table reducibility, Trans. Amer. Math. Soc. 115 (1965), 329 – 339. · Zbl 0163.25203
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.