References
Davis, M.: Computability and Unsolvability. New York 1958.
Dekker, J. C. E.: Productive sets. Trans. Amer. math. Soc.78, 129–149 (1955).
Dekker, J. C. E.: Two notes on recursively enumerable sets. Proc. Amer. math. Soc.4, 495–501 (1953).
Dekker, J. C. E., andJ. Myhill: Recursive equivalence types, to be published by the University of California Publications in Mathematics.
Dekker, J. C. E., andJ. Myhill: Retraceable sets. Canad. J. Math.10, 357–373 (1958).
Harary, F.: The number of functional digraphs. Math. Ann.138, 203–210 (1959).
Kleene, S. C.: Recursive functions and intuitionistic mathematics. Proc. Int. Congress of Mathematicians. vol.1, pp. 679–685. Cambridge, Mass., U.S.A. (1950; published 1952).
Myhill, J.: Creative sets. Z. math. Log. u. Grundlagen d. Math.1, 97–108 (1955).
Post, E. L.: Recursively enumerable sets and their decision-problems. Bull. Amer. math. Soc.50, 284–316 (1944).
Ullian, J.: Splinters of recursive functions (abstract of a paper read at a meeting of the Association for Symbolic Logic, December 1957). J. Symb. Log.23, 107–108 (1958).
Uspenski, V. A.: Neskol'ko zamečanij o perečislimykh množestvakh. Z. math. Log. u. Grundlagen d. Math.3, 157–170 (1957).
Author information
Authors and Affiliations
Additional information
This work was supported by grants from the National Science Foundation (G 3466) and the Institute for Advanced Study. I wish to thankF. Harary andD. Lacombe for ideas which are incorporated into this paper.
Rights and permissions
About this article
Cite this article
Myhill, J. Recursive digraphs, splinters and cylinders. Math. Ann. 138, 211–218 (1959). https://doi.org/10.1007/BF01342904
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01342904