• [1] K. I. Appel and T. G. McLaughlin, On properties of regressive sets, Trans. Amer. Math. Soc. 115 (1965), 83–93. MR 0230616, https://doi.org/10.1090/S0002-9947-1965-0230616-0
• [2] J. C. E. Dekker, A theorem on hypersimple sets, Proc. Amer. Math. Soc. 5 (1954), 791–796. MR 0063995, https://doi.org/10.1090/S0002-9939-1954-0063995-6
• [3] J. C. E. Dekker and J. Myhill, Retraceable sets, Canad. J. Math. 10 (1958), 357–373. MR 0099292, https://doi.org/10.4153/CJM-1958-035-x
• [4] Patrick C. Fischer, A note on bounded-truth-table reducibility, Proc. Amer. Math. Soc. 14 (1963), 875–877. MR 0155757, https://doi.org/10.1090/S0002-9939-1963-0155757-1
• [5] C. G. Jockusch, Jr., Reducibilities in recursive function theory, Doctoral Thesis, Massachusetts Institute of Technology, Cambridge, 1966.
• [6] Carl G. Jockusch Jr., Semirecursive sets and positive reducibility, Trans. Amer. Math. Soc. 131 (1968), 420–436. MR 0220595, https://doi.org/10.1090/S0002-9947-1968-0220595-7
• [7] A. H. Lachlan, Many-one degrees (to appear).
• [8] M. Lerman, Recursive functions modulo co-maximal sets, Doctoral Thesis, Cornell Univ., Ithaca, N. Y., 1968.
• [9] D. A. Martin, Measure, category, and degrees of unsolvability (unpublished).
• [10] Webb Miller and D. A. Martin, The degrees of hyperimmune sets, Z. Math. Logik Grundlagen Math. 14 (1968), 159–166. MR 0228341
• [11] John Myhill, Creative sets, Z. Math. Logik Grundlagen Math. 1 (1955), 97–108. MR 0071379
• [12] A. Nerode, General topology and partial recursive functionals, Summaries of talks presented at the Summer Institute for Symbolic Logic, Cornell University, 1957, pp. 247-251.
• [13] Emil L. Post, Recursively enumerable sets of positive integers and their decision problems, Bull. Amer. Math. Soc. 50 (1944), 284–316. MR 0010514, https://doi.org/10.1090/S0002-9904-1944-08111-1
• [14] H. G. Rice, Recursive and recursively enumerable orders, Trans. Amer. Math. Soc. 83 (1956), 277–300. MR 0083454, https://doi.org/10.1090/S0002-9947-1956-0083454-0
• [15] Hartley Rogers Jr., Theory of recursive functions and effective computability, McGraw-Hill Book Co., New York-Toronto, Ont.-London, 1967. MR 0224462
• [16] Robert I. Soare, Recursive theory and Dedekind cuts, Trans. Amer. Math. Soc. 140 (1969), 271–294. MR 0242667, https://doi.org/10.1090/S0002-9947-1969-0242667-4
• [17] C. E. M. Yates, Three theorems on the degrees of recursively enumerable sets, Duke Math. J. 32 (1965), 461–468. MR 0180486
• [18] Paul R. Young, Linear orderings under one-one reducibility, J. Symbolic Logic 31 (1966), 70–85. MR 0231720, https://doi.org/10.2307/2270621

Bibliography

[1]

K. I. Appel and T. G. McLaughlin, On properties of regressive sets, Trans. Amer. Math. Soc. 115 (1965), 83-93. MR 0230616 (37:6176)

[2]

J. C. E. Dekker, A theorem on hypersimple sets, Proc. Amer. Math. Soc. 5 (1954), 791-796. MR 0063995 (16:209b)

[3]

J. C. E. Dekker and J. Myhill, Retraceable sets, Canad. J. Math. 10 (1958), 357-373. MR 0099292 (20:5733)

[4]

P. C. Fischer, A note on bounded-truth-table reducibility, Proc. Amer. Math. Soc. 14 (1963), 875-877. MR 0155757 (27:5691)

[5]

C. G. Jockusch, Jr., Reducibilities in recursive function theory, Doctoral Thesis, Massachusetts Institute of Technology, Cambridge, 1966.

[6]

-, Semirecursive sets and positive reducibility, Trans. Amer. Math. Soc. 131 (1968), 420-436. MR 0220595 (36:3649)

[7]

A. H. Lachlan, Many-one degrees (to appear).

[8]

M. Lerman, Recursive functions modulo co-maximal sets, Doctoral Thesis, Cornell Univ., Ithaca, N. Y., 1968.

[9]

D. A. Martin, Measure, category, and degrees of unsolvability (unpublished).

[10]

W. Miller and D. A. Martin, The degrees of hyperimmune sets, Z. Math. Logik Grundlagen Math. 14 (1968), 159-166. MR 0228341 (37:3922)

[11]

J. Myhill, Creative sets, Z. Math. Logik Grundlagen Math. 1 (1955), 97-108. MR 0071379 (17:118g)

[12]

A. Nerode, General topology and partial recursive functionals, Summaries of talks presented at the Summer Institute for Symbolic Logic, Cornell University, 1957, pp. 247-251.

[13]

E. L. Post, Recursively enumerable sets of integers and their decision problems, Bull. Amer. Math. Soc. 50 (1944), 284-316. MR 0010514 (6:29f)

[14]

H. G. Rice, Recursive and recursively enumerable orders, Trans. Amer. Math. Soc. 83 (1956), 277-300. MR 0083454 (18:712a)

[15]

H. Rogers, Jr., Theory of recursive functions and effective computability, McGraw-Hill, New York, 1967. MR 0224462 (37:61)

[16]

R. I. Soare, Recursion theory and Dedekind cuts, Trans. Amer. Math. Soc. 140 (1969), 271-294. MR 0242667 (39:3997)

[17]

C. E. M. Yates, Three theorems on the degrees of recursively enumerable sets, Duke Math. J. 32 (1965), 461-468. MR 0180486 (31:4721)

[18]

P. R. Young, Linear orderings under one-one reducibility, J. Symbolic Logic 31 (1966), 70-85. MR 0231720 (38:48)