Recursively Enumberable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets (Perspectives in Mathematical Logic)

The first part consists of an introduction to the theory of computation and recursive function theory, including definitions of computable functions, Turing machines, partial recursive functions, recursively enumerable sets, the Kleene recursion theorem etc. The second part is a comprehensive study of recursively enumerable sets and their degrees.