Basic proof theory
 Responsibility
 A. S. Troelstra, H. Schwichtenberg.
 Edition
 2nd ed.
 Imprint
 Cambridge ; New York : Cambridge University Press, 2000.
 Physical description
 xii, 417 p. ; 23 cm.
 Series
 Cambridge tracts in theoretical computer science 43.
Online
At the library
Philosophy Library (Tanner)
Stacks
Call number  Note  Status 

QA9.54 .T76 2000  Unknown 
Science Library (Li and Ma)
Stacks
Call number  Note  Status 

QA9.54 .T76 2000  Unknown 
More options
Description
Creators/Contributors
 Author/Creator
 Troelstra, A. S. (Anne Sjerp)
 Contributor
 Schwichtenberg, Helmut, 1942
Contents/Summary
 Bibliography
 Includes bibliographical references (p. 379403) and index.
 Contents

 1. Introduction
 2. Nsystems and Hsystems
 3. Gentzen systems
 4. Cut elimination with applications
 5. Bounds and permutations
 6. Normalization for natural deduction
 7. Resolution
 8. Categorical logic
 9. Modal and linear logic
 10. Proof theory of arithmetic
 11. Secondorder logic
 Solutions to selected exercises. Bibliography
 Symbols and notation
 Index.
 (source: Nielsen Book Data)
 Publisher's summary

This introduction to the basic ideas of structural proof theory contains a thorough discussion and comparison of various types of formalization of firstorder logic. Examples are given of several areas of application, namely: the metamathematics of pure firstorder logic (intuitionistic as well as classical); the theory of logic programming; category theory; modal logic; linear logic; firstorder arithmetic and secondorder logic. In each case the aim is to illustrate the methods in relatively simple situations and then apply them elsewhere in much more complex settings. There are numerous exercises throughout the text. In general, the only prerequisite is a standard course in firstorder logic, making the book ideal for graduate students and beginning researchers in mathematical logic, theoretical computer science and artificial intelligence. For the new edition, many sections have been rewritten to improve clarity, new sections have been added on cut elimination, and solutions to selected exercises have been included.
(source: Nielsen Book Data)
Subjects
 Subjects
 Proof theory.
Bibliographic information
 Publication date
 2000
 Series
 Cambridge tracts in theoretical computer science ; 43
 Note
 Previous ed.: 1996.
 ISBN
 0521779111
 9780521779111 (pbk.)
 0521784522
 9780521784528