Recursively Enumerable Sets
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.
KeywordsProductive Function Recursive Function Closure Property Partial Recursive Function Primitive Recursive Function
Unable to display preview. Download preview PDF.
- 1.Malcev, A. I. Algorithms and Recursive Functions. Groningen: Wolters-Noordhoff (1970).Google Scholar