Computational Logic
Overview
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).
This item is Non-Returnable
Customers Also Bought
Details
- ISBN-13: 9783540645894
- ISBN-10: 3540645896
- Publisher: Springer
- Publish Date: April 1999
- Dimensions: 9.21 x 6.14 x 1 inches
- Shipping Weight: 1.8 pounds
- Page Count: 448
Related Categories
