Computational Logic
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).
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).
Keywords
ComputersProgrammingCompilersComputer ArchitectureComputer ScienceInformation TechnologyLogic DesignMachine TheoryLanguagesSoftware Development & EngineeringSystems Analysis & DesignHardwareMathematicsDiscrete MathematicsLogicMedical
1999Book
Author(s)J. Girard, Helmut Schwichtenberg, Ulrich Berger, D. Miller, S. R. Buss
PublisherSpringer Science & Business Media
ISBN9783540645894
LanguageEnglish
