Basic Proof Theory

2. Auflage 2002
ISBN: 978-0-521-77911-1
Verlag: Cambridge University Press

Buch, Englisch, Band 43, 430 Seiten, Format (B × H): 152 mm x 229 mm, Gewicht: 697 g

Reihe: Cambridge Tracts in Theoretical Computer Science

This introduction to the basic ideas of structural proof theory contains a thorough discussion and comparison of various types of formalization of first-order logic. Examples are given of several areas of application, namely: the metamathematics of pure first-order logic (intuitionistic as well as classical); the theory of logic programming; category theory; modal logic; linear logic; first-order arithmetic and second-order 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 first-order 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.

Autoren/Hrsg.

Troelstra, Anne S.

Troelstra, A. S.

Schwichtenberg, H.

Fachgebiete

• Mathematik | Informatik Mathematik Mathematik Allgemein Mathematische Logik
• Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
• Mathematik | Informatik EDV | Informatik Informatik Mathematik für Informatiker

Inhaltsverzeichnis

1. Introduction; 2. N-systems and H-systems; 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. Second-order logic; Solutions to selected exercises. Bibliography; Symbols and notation; Index.