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.

Preface. List of Contributors. Chapter I. An Introduction to Proof Theory (S.R. Buss). Chapter II. First-Order Proof Theory of Arithmetic (S.R. Buss). Chapter III. Hierarchies of Provably Recursive Functions (M. Fairtlough, S.S. Wainer). Chapter IV. Subsystems of Set Theory and Second Order Number Theory (W. Pohlers). Chapter V. Gödels Functional ("Dialectica") Interpretation (J. Avigad, S. Feferman). Chapter VI. Realizability (A.S. Troelstra). Chapter VII. The Logic of Provability (G. Japaridze, D. de Jongh). Chapter VIII. The Lengths of Proofs (P. Pudlþk). Chapter IX. A Proof-Theoretic Framework for Logic Programming (G. Jäger, R.F. Stärk)). Chapter X. Types in Logic, Mathematics and Programming (R.L. Constable). Name Index. Subject Index.

Includes bibliographical references and indexes.

Print version record.

Elsevier ScienceDirect All Books