Buch, Englisch, 810 Seiten, Format (B × H): 156 mm x 234 mm, Gewicht: 1410 g
Buch, Englisch, 810 Seiten, Format (B × H): 156 mm x 234 mm, Gewicht: 1410 g
ISBN: 978-0-444-89840-1
Verlag: Elsevier Science & Technology
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.
Autoren/Hrsg.
Fachgebiete
Weitere Infos & Material
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ödel's 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.