Handbook of Proof Theory (Google eBook)
Elsevier, Jul 9, 1998 - Computers - 810 pages
This volume contains articles covering a broad spectrum of proof theory, with an emphasis on its mathematical aspects. The articles should not only be interesting to specialists of proof theory, but should also be accessible to a diverse audience, including logicians, mathematicians, computer scientists and philosophers. Many of the central topics of proof theory have been included in a self-contained expository of articles, covered in great detail and depth.
The chapters are arranged so that the two introductory articles come first; these are then followed by articles from core classical areas of proof theory; the handbook concludes with articles that deal with topics closely related to computer science.
What people are saying - Write a review
Chapter II FirstOrder Proof Theory of Arithmetic
Chapter III Hierarchies of Provably Recursive Functions
Chapter IV Subsystems of Set Theory and Second Order Number Theory
Chapter V Gödels Functional Dialectica Interpretation
Chapter VI Realizability
Chapter VII The Logic of Provability
Chapter X Types in Logic Mathematics and Programming