Explore the latest books of this year!
Bookbot

Ulrich Berger

    Les cheminements de la politique suisse des transports
    Übergang von Bachelor-Absolventen in den Beruf
    Frust und Freude
    Germany
    Wales
    Computational logic
    • 1999

      Computational logic

      • 444 pages
      • 16 hours of reading

      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).

      Computational logic