Computational Logic

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

Game Semantics. - Notes on the Simply Typed Lambda Calculus. - Problems in Type Theory. - Formal Correctness Proofs of Functional Programs: Dijkstra s Algorithm, a Case Study. - Propositional Proof Complexity An Introduction. - Formalizing Decidability Theorems About Automata. - On the Meaning of Logical Rules I: Syntax Versus Semantics. - Complexity of Primitive Recursion. - Computers, Reasoning and Mathematical Practice. - Research Directions in Rewriting Logic. - Sequent Calculus and the Specification of Computation.