Cantitate/Preț
Produs

Basic Proof Theory: Cambridge Tracts in Theoretical Computer Science, cartea 43

Autor A. S. Troelstra, H. Schwichtenberg
en Limba Engleză Paperback – 26 iul 2000
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.
Citește tot Restrânge

Din seria Cambridge Tracts in Theoretical Computer Science

Preț: 30052 lei

Preț vechi: 37565 lei
-20% Nou

Puncte Express: 451

Preț estimativ în valută:
5751 5974$ 4777£

Carte tipărită la comandă

Livrare economică 03-17 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780521779111
ISBN-10: 0521779111
Pagini: 432
Ilustrații: 3 b/w illus. 201 exercises
Dimensiuni: 154 x 227 x 23 mm
Greutate: 0.63 kg
Ediția:Revizuită
Editura: Cambridge University Press
Colecția Cambridge University Press
Seria Cambridge Tracts in Theoretical Computer Science

Locul publicării:Cambridge, United Kingdom

Cuprins

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.

Recenzii

'This is a fine book. Any computer scientist with some logical background will benefit from studying it. It is written by two of the experts in the field and comes up to their usual standards of precision and care.' Ray Turner, Computer Journal

Descriere

Introduction to proof theory and its applications in mathematical logic, theoretical computer science and artificial intelligence.