Description
This volume, the first in the acclaimed series Lecture Notes in Logic, published by the ASSOCIATION FOR SYMBOLIC LOGIC, serves as an introduction to recursion theory. The fundamental concept of recursion makes the idea of computability accessible to mathematical analysis and thereby forms one of the pillars on which modern computer science rests. The clarity and focus of this text have established it as a classic instrument for teaching and self-study. The book prepares its readers for the study of advanced topics in recursion theory. We are pleased to make the book available again in an attractive format and at a reasonable price. Topics covered include computability, functions and relations, macros, codes, indices, Church's thesis, word problems, and relative recursion.