Abstract
We have developed recursion theory as much as we need for our later purposes in logic. But in this chapter we want to survey, without proofs, some further topics. Most of these topics are also frequently useful in logical investigations.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliography
Boone, W. W. The word problem. Ann. Math., 70 (1959), 207–265.
Davis, M. Hilbert’s tenth problem is unsolvable. Amer. Math. Monthly, 80 (1973), 233–269.
Dekker, J. C. E. Les Fonctions Combinatoires et les Isols. Paris: Gauthier-Villars (1966).
Dekker, J. C. E. and Myhill, J. Recursive equivalence types. Univ. Calif. Publ. Math., 3 (1960), 67–214.
Hermes, H. Enumerability, Decidability, Computability. New York: Springer (1969).
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1976 Springer-Verlag Inc.
About this chapter
Cite this chapter
Monk, J.D. (1976). Survey of Recursion Theory. In: Mathematical Logic. Graduate Texts in Mathematics, vol 37. Springer, New York, NY. https://doi.org/10.1007/978-1-4684-9452-5_8
Download citation
DOI: https://doi.org/10.1007/978-1-4684-9452-5_8
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4684-9454-9
Online ISBN: 978-1-4684-9452-5
eBook Packages: Springer Book Archive