Abstract
We have been concerned so far with just the definitions of mathematical notions of effectiveness. We now want to give an introduction to the theory of effectiveness based on these definitions. Most of the technical details of the proofs of the results of this chapter are implicit in our earlier work. We wish to look at the proofs and results so far stated and try to see their significance.
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
Kleene, S. C. Introduction to Metamathematics. Princeton: van Nostrand (1952).
Malcev, A. I. Algorithms and Recursive Functions. Groningen: Wolters-Noordhoff (1970).
Rogers, H. Theory of Recursive Functions and Effective Computability. New York: McGraw-Hill (1967).
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1976 Springer-Verlag Inc.
About this chapter
Cite this chapter
Monk, J.D. (1976). 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_6
Download citation
DOI: https://doi.org/10.1007/978-1-4684-9452-5_6
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