Abstract
In this chapter we shall deal in some detail with the set Σ1 of relations (see 5.24). Such relations are called recursively enumerable for reasons which will shortly become clear. The study of recursively enumerable relations is one of the main branches of recursive function theory. They play a large role in logic. In fact, for most theories the set of Gödel numbers of theorems is recursively enumerable. Thus many of the concepts introduced in this section will have applications in our discussion of decidable and undecidable theories in Part III. Unless otherwise stated, the functions in this chapter are unary.
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
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).
Smullyan, R. M. Theory of Formal Systems. Princeton: Princeton University Press (1961).
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1976 Springer-Verlag Inc.
About this chapter
Cite this chapter
Monk, J.D. (1976). Recursively Enumerable Sets. In: Mathematical Logic. Graduate Texts in Mathematics, vol 37. Springer, New York, NY. https://doi.org/10.1007/978-1-4684-9452-5_7
Download citation
DOI: https://doi.org/10.1007/978-1-4684-9452-5_7
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