Proof and computations

Preface Preliminaries Part I. Basic Proof Theory and Computability: 1. Logic 2. Recursion theory 3. Godel's theorems Part II. Provable Recursion in Classical Systems: 4. The provably recursive functions of arithmetic 5. Accessible recursive functions, ID<omega and PI11-CA0 Part III. Constructive Logic and Complexity: 6. Computability in higher types 7. Extracting computational content from proofs 8. Linear two-sorted arithmetic Bibliography Index.