Handbook of Proof Theory (Google eBook)

Front Cover
S.R. Buss
Elsevier, Jul 9, 1998 - Computers - 810 pages
1 Review
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

We haven't found any reviews in the usual places.

Contents

Chapter II FirstOrder Proof Theory of Arithmetic
79
Chapter III Hierarchies of Provably Recursive Functions
149
Chapter IV Subsystems of Set Theory and Second Order Number Theory
209
Chapter V Gödels Functional Dialectica Interpretation
337
Chapter VI Realizability
407
Chapter VII The Logic of Provability
475
Chapter VIII The Lengths of Proofs
547
Chapter IX A ProofTheoretic Framework for Logic Programming
639
Chapter X Types in Logic Mathematics and Programming
683
Name Index
787
Subject Index
797
Copyright

Common terms and phrases

Popular passages

Page 73 - S. Abramsky and R. Jagadeesan. Games and full completeness for multiplicative linear logic. Journal of Symbolic Logic, 59(2):543 - 574, June 1994.
Page 29 - KB exhibits consistent knowledge if and only if there is no sentence a such that both a and ->a are known.

References to this book

All Book Search results »

Bibliographic information