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<�ω and Π11–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.
This major graduate-level text provides a detailed, self-contained coverage of proof theory.
Helmut Schwichtenberg is an Emeritus Professor of Mathematics at Ludwig-Maximilians-Universität München. He has recently developed the 'proof-assistant' MINLOG, a computer-implemented logic system for proof/program development and extraction of computational content. Stanley S. Wainer is an Emeritus Professor of Mathematics at the University of Leeds and a past-President of the British Logic Colloquium.
"Written by two leading practitioners in the area of formal logic,
the book provides a panoramic view of the topic. This reference
volume is a must for the bookshelf of every practitioner of formal
logic and computer science."
Prahladavaradan Sampath, Computing Reviews
 |
Ask a Question About this Product More... |
|
