In 1931, Princeton mathematician Kurt Godel startled the scientific world with his 'Theorem of Undecidability', which showed that some statements in mathematics are inherently 'undecidable'. This volume of the 'Oxford Logic Guides' is a sequel to Smullyan's Godel's 'Incompleteness Theorems' (Oxford Logic Guides No. 19, 1992). thanks to the virtual lack or prerequisites and the detailed, easy-to-follow proofs, Recursion Theory for Metamathematics is highly accessible to beginning logicians ... There is much, both in results and in methods, that will be of interest to a variety of readers.