| Computational Logic Contributor(s): Berger, Ulrich (Editor), Schwichtenberg, Helmut (Editor) |
|
 |
ISBN: 3540645896 ISBN-13: 9783540645894 Publisher: Springer OUR PRICE: $161.49 Product Type: Hardcover - Other Formats Published: April 1999 Annotation: Recent developments in computer science clearly show the need for a better theoretical foundation for some central issues. Methods and results from mathematical logic, in particular proof theory and model theory, are of great help here and will be used much more in future than previously. This book provides an excellent introduction to the interplay of mathematical logic and computer science. It contains extensively reworked versions of the lectures given at the 1997 Marktoberdorf Summer School by leading researchers in the field. Topics covered include: proof theory and specification of computation (J.-Y. Girard, D. Miller), complexity of proofs and programs (S. R. Buss, S. S. Wainer), computational content of proofs (H. Schwichtenberg), constructive type theory (P. Aczel, H. Barendregt, R. L. Constable), computational mathematics, (U. Martin), rewriting logic (J. Meseguer), and game semantics (S. Abramski). |
| Additional Information |
| BISAC Categories: - Computers | Machine Theory - Computers | Compilers - Mathematics | Logic |
| Dewey: 005.101 |
| LCCN: 99013850 |
| Series: NATO Asi Subseries F: |
| Physical Information: 1" H x 6.14" W x 9.21" (1.80 lbs) 448 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: Recent developments in computer science clearly show the need for a better theoretical foundation for some central issues. Methods and results from mathematical logic, in particular proof theory and model theory, are of great help here and will be used much more in future than previously. This book provides an excellent introduction to the interplay of mathematical logic and computer science. It contains extensively reworked versions of the lectures given at the 1997 Marktoberdorf Summer School by leading researchers in the field. Topics covered include: proof theory and specification of computation (J.-Y. Girard, D. Miller), complexity of proofs and programs (S. R. Buss, S. S. Wainer), computational content of proofs (H. Schwichtenberg), constructive type theory (P. Aczel, H. Barendregt, R. L. Constable), computational mathematics, (U. Martin), rewriting logic (J. Meseguer), and game semantics (S. Abramski). |