|
Link to the Homepage: Introduction to Computational Logic
| |
Biographies of important logicians | |
Andrews, Peter B. An introduction to mathematical logic and type theory: To truth through proof Kluwer Academic Publishers 2002 | |
Baader, Franz and Nipkow, Tobias Term rewriting and all that Cambridge University Press 1999 | |
Bertot, Yves and Casteran, Pierre Interactive theorem proving and program development Springer 2004 | |
Forster, Thomas Logic, induction and sets Cambridge Univ. Press 2003 | |
Girard, Jean-Yves Proof and types Cambridge University Press 1993 | |
Hindley, James Roger and Seldin Jonathan P. Lambda-calculus and combinators Cambridge University Press 2008 | |
Institute for advanced study Homotopy type theory Princeton, NJ 2013 | |
Luo, Zhaohui Computation and reasoning: A type theory for computer science Oxford University Press 2002 | |
Per, Martin-Löf Intuitionistic type theory Bibliopolis 1984 | |
Prawitz, Dag Natural deduction: A proof-theoretical study Dover Publications 2006 | |
Robinson, Alan Handbook of automated reasoning - Band 2 Course relevant article: Proof assistants using dependent type systems (p. 1149-1238) by Barendregt, Henk and Geuvers, Herman North Holland 2001 | |
Sørensen, Morten Heine and Urzyczyn, Pawel Lectures on the Curry-Howard isomorphism Elsevier 2006 | |
Troelstra, Anne Sjerp and Schwichtenberg, Helmut Basic proof theory Cambridge University Press 2003 |