Proof Theory in Computer Science

Reinhard Kahle

ISBN 10: 354042752X / ISBN 13: 9783540427520

Published by Springer Berlin Heidelberg, Springer Berlin Heidelberg Sep 2001, 2001

About this Item

Neuware -Proof theory has long been established as a basic discipline of mathematical logic. It has recently become increasingly relevant to computer science. The - ductive apparatus provided by proof theory has proved useful for metatheoretical purposes as well as for practical applications. Thus it seemed to us most natural to bring researchers together to assess both the role proof theory already plays in computer science and the role it might play in the future. The form of a Dagstuhl seminar is most suitable for purposes like this, as Schloß Dagstuhl provides a very convenient and stimulating environment to - scuss new ideas and developments. To accompany the conference with a proc- dings volume appeared to us equally appropriate. Such a volume not only xes basic results of the subject and makes them available to a broader audience, but also signals to the scienti c community that Proof Theory in Computer Science (PTCS) is a major research branch within the wider eld of logic in computer science.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 256 pp. Englisch.

Seller Inventory # 9783540427520

Bibliographic Details

• Title: Proof Theory in Computer Science
• Publisher: Springer Berlin Heidelberg, Springer Berlin Heidelberg Sep 2001
• Publication Date: 2001
• Language: English
• ISBN 10: 354042752X
• ISBN 13: 9783540427520
• Binding: Taschenbuch
• Condition: Neu

About this title

Synopsis

Proof theory has long been established as a basic discipline of mathematical logic. It has recently become increasingly relevant to computer science. The - ductive apparatus provided by proof theory has proved useful for metatheoretical purposes as well as for practical applications. Thus it seemed to us most natural to bring researchers together to assess both the role proof theory already plays in computer science and the role it might play in the future. The form of a Dagstuhl seminar is most suitable for purposes like this, as Schloß Dagstuhl provides a very convenient and stimulating environment to - scuss new ideas and developments. To accompany the conference with a proc- dings volume appeared to us equally appropriate. Such a volume not only ?xes basic results of the subject and makes them available to a broader audience, but also signals to the scienti?c community that Proof Theory in Computer Science (PTCS) is a major research branch within the wider ?eld of logic in computer science.

Synopsis

This book constitutes the refereed proceedings of the International Seminar on Proof Theory in Computer Science, PTCS 2001, held in Dagstuhl Castle, Germany, in October 2001. The 13 thoroughly revised full papers were carefully reviewed and selected for inclusion in the book. Among the topics addressed are higher type recursion, lambda calculus, complexity theory, transfinite induction, categories, induction-recursion, post-Turing analysis, natural deduction, implicit characterization, iterate logic, and Java programming.