http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
This volume, which ten years ago appeared as the first in the acclaimed series Lecture Notes in Logic, serves as an introduction to recursion theory. The fundamental concept of recursion makes the idea of computability accessible to a mathematical analysis, thus forming 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 that prepares its readers for the study of advanced monographs and the current literature on recursion theory.
Chapter 1 Computability / Joseph R. Shoenfield -- chapter 2 Functions and Relations / Joseph R. Shoenfield -- chapter 3 The Basic Machine / Joseph R. Shoenfield -- chapter 4 Macros / Joseph R. Shoenfield -- chapter 5 Closure Properties / Joseph R. Shoenfield -- chapter 6 Definitions of Recursive Functions / Joseph R. Shoenfield -- chapter 7 Codes / Joseph R. Shoenfield -- chapter 8 Indices / Joseph R. Shoenfield -- chapter 9 Church's Thesis / Joseph R. Shoenfield -- chapter 10 Word Problems / Joseph R. Shoenfield -- chapter 11 Undecidable Theories / Joseph R. Shoenfield -- chapter 12 Relative Recursion / Joseph R. Shoenfield -- chapter 13 The Arithmetical Hierarchy / Joseph R. Shoenfield -- chapter 14 Recursively Enumerable Relations / Joseph R. Shoenfield -- chapter 15 Degrees / Joseph R. Shoenfield -- chapter 16 Evaluation of Degrees / Joseph R. Shoenfield -- chapter 17 Large RE Sets / Joseph R. Shoenfield -- chapter 18 Function of Reals / Joseph R. Shoenfield -- chapter 19 The Analytical Hierarchy / Joseph R. Shoenfield -- chapter 20 The Projective Hierarchy / Joseph R. Shoenfield.
Includes bibliographical references and index.