Cambridge University Press (2000)
Mathematics is about proofs, that is the derivation of correct statements; and calculations, that is the production of results according to well-defined sets of rules. The two notions are intimately related. Proofs can involve calculations, and the algorithm underlying a calculation should be proved correct. The aim of the author is to explore this relationship. The book itself forms an introduction to simple type theory. Starting from the familiar propositional calculus the author develops the central idea of an applied lambda-calculus. This is illustrated by an account of Gödel's T, a system which codifies number-theoretic function hierarchies. Each of the book's 52 sections ends with a set of exercises, some 200 in total. These are designed to help the reader get to grips with the subject, and develop a further understanding. An appendix contains complete solutions of these exercises.
|Keywords||Proof theory Lambda calculus Type theory Curry-Howard isomorphism|
|Categories||categorize this paper)|
|Buy the book||$60.00 new (65% off) $82.00 used (52% off) $158.51 direct from Amazon (15% off) Amazon page|
|Call number||QA9.54.S55 2000|
References found in this work BETA
No references found.
Citations of this work BETA
On the Syntax of Logic and Set Theory.Lucius T. Schoenbaum - 2010 - Review of Symbolic Logic 3 (4):568-599.
Similar books and articles
Lambda Calculus and Intuitionistic Linear Logic.Simona Ronchi Della Rocca & Luca Roversi - 1997 - Studia Logica 59 (3):417-448.
The Completeness of Heyting First-Order Logic.W. W. Tait - 2003 - Journal of Symbolic Logic 68 (3):751-763.
A Lambda Proof of the P-W Theorem.Sachio Hirokawa, Yuichi Komori & Misao Nagayama - 2000 - Journal of Symbolic Logic 65 (4):1841-1849.
Added to index2009-01-28
Total downloads13 ( #350,162 of 2,158,394 )
Recent downloads (6 months)2 ( #194,528 of 2,158,394 )
How can I increase my downloads?