On semi-cylinders, splinters, and bounded-truth-table reducibility. (English) Zbl 0163.25203
References:
| [1] | Patrick C. Fischer, A note on bounded-truth-table reducibility, Proc. Amer. Math. Soc. 14 (1963), 875 – 877. · Zbl 0124.24602 |
| [2] | John Myhill, Creative sets, Z. Math. Logik Grundlagen Math. 1 (1955), 97 – 108. · Zbl 0065.00105 |
| [3] | John Myhill, Recursive digraphs, splinters and cylinders, Math. Ann. 138 (1959), 211 – 218. · Zbl 0087.25103 · doi:10.1007/BF01342904 |
| [4] | Emil L. Post, Recursively enumerable sets of positive integers and their decision problems, Bull. Amer. Math. Soc. 50 (1944), 284 – 316. · Zbl 0063.06328 |
| [5] | Hartley Rogers Jr., Theory of recursive functions and effective computability, McGraw-Hill Book Co., New York-Toronto, Ont.-London, 1967. |
| [6] | J. R. Shoenfield, Quasicreative sets, Proc. Amer. Math. Soc. 8 (1957), 964 – 967. · Zbl 0080.24401 |
| [7] | Paul R. Young, A note on pseudo-creative sets and cylinders, Pacific J. Math. 14 (1964), 749 – 753. · Zbl 0208.01901 |
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.
