Atjaunināt sīkdatņu piekrišanu

Basic Proof Theory 2nd Revised edition [Mīkstie vāki]

3.91/5 (13 ratings by Goodreads)
(Universität Munchen), (Universiteit van Amsterdam)
  • Formāts: Paperback / softback, 432 pages, height x width x depth: 227x154x23 mm, weight: 595 g, Worked examples or Exercises; 3 Line drawings, unspecified
  • Sērija : Cambridge Tracts in Theoretical Computer Science
  • Izdošanas datums: 27-Jul-2000
  • Izdevniecība: Cambridge University Press
  • ISBN-10: 0521779111
  • ISBN-13: 9780521779111
  • Mīkstie vāki
  • Cena: 63,82 €
  • Grāmatu piegādes laiks ir 3-4 nedēļas, ja grāmata ir uz vietas izdevniecības noliktavā. Ja izdevējam nepieciešams publicēt jaunu tirāžu, grāmatas piegāde var aizkavēties.
  • Daudzums:
  • Ielikt grozā
  • Piegādes laiks - 4-6 nedēļas
  • Pievienot vēlmju sarakstam
  • Formāts: Paperback / softback, 432 pages, height x width x depth: 227x154x23 mm, weight: 595 g, Worked examples or Exercises; 3 Line drawings, unspecified
  • Sērija : Cambridge Tracts in Theoretical Computer Science
  • Izdošanas datums: 27-Jul-2000
  • Izdevniecība: Cambridge University Press
  • ISBN-10: 0521779111
  • ISBN-13: 9780521779111
Introduction to proof theory and its applications in mathematical logic, theoretical computer science and artificial intelligence.

This introduction to the basic ideas of structural proof theory contains a thorough discussion and comparison of various types of first-order logic formalization. Examples are given of several areas of application, namely: the metamathematics of pure first-order logic, logic programming theory, category theory, modal logic, linear logic, first-order arithmetic and second-order logic. In each case the authors illustrate the methods in relatively simple situations and then apply them elsewhere in much more complex settings. For the new edition, they have rewritten many sections to improve clarity, added new sections on cut elimination, and included solutions to selected exercises. 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.

Recenzijas

'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

Papildus informācija

Introduction to proof theory and its applications in mathematical logic, theoretical computer science and artificial intelligence.
Preface ix
Introduction
1(34)
Preliminaries
2(8)
Simple type theories
10(12)
Three types of formalism
22(13)
N-systems and H-systems
35(25)
Natural deduction systems
35(10)
Ni as a term calculus
45(3)
The relation between C, I and M
48(3)
Hilbert systems
51(4)
Notes
55(5)
Gentzen systems
60(32)
The G1-and G2-systems
61(5)
The Cut rule
66(2)
Equivalence of G- and N-systems
68(7)
Systems with local rules
75(2)
Absorbing the structural rules
77(8)
The one-sided systems for C
85(2)
Notes
87(5)
Cut elimination with applications
92(55)
Cut elimination
92(13)
Applications of cutfree systems
105(7)
A more efficient calculus for Ip
112(4)
Interpolation and definable functions
116(10)
Extensions of G1-systems
126(4)
Extensions of G3-systems
130(4)
Logic with equality
134(2)
The theory of apartness
136(3)
Notes
139(8)
Bounds and permutations
147(31)
Numerical bounds on cut elimination
148(9)
Size and cut elimination
157(7)
Permutation of rules for classical logic
164(7)
Permutability of rules for G1i
171(5)
Notes
176(2)
Normalization for natural deduction
178(52)
Conversions and normalization
178(6)
The structure of normal derivations
184(5)
Normality in G-systems and N-systems
189(8)
Extensions with simple rules
197(2)
E-logic and ordinary logic
199(4)
Conservativity of predicative classes
203(2)
Conservativity for Horn clauses
205(5)
Strong normalization for →Nm and λ
210(5)
Hyperexponential bounds
215(2)
A digression: a stronger conversion
217(2)
Orevkov's result
219(4)
Notes
223(7)
Resolution
230(28)
Introduction to resolution
230(2)
Unification
232(4)
Linear resolution
236(7)
From Gentzen system to resolution
243(3)
Resolution for Ip
246(9)
Notes
255(3)
Categorical logic
258(25)
Deduction graphs
259(5)
Lambda terms and combinators
264(7)
Decidability of equality
271(3)
A coherence theorem for CCC's
274(7)
Notes
281(2)
Modal and linear logic
283(34)
The modal logic S4
284(4)
Embedding intuitionistic logic into S4
288(4)
Linear logic
292(8)
A system with privileged formulas
300(3)
Proofnets
303(10)
Notes
313(4)
Proof theory of arithmetic
317(28)
Ordinals below ϵ0
318(3)
Provability of initial cases of TI
321(4)
Normalization with the omega rule
325(5)
Unprovable initial cases of TI
330(7)
TI for non-standard orderings
337(5)
Notes
342(3)
Second-order logic
345(22)
Intuitionistic second-order logic
345(4)
Ip2 and λ2
349(2)
Strong normalization for Ni2
351(6)
Encoding of λ2Ω into λ2
357(1)
Provably recursive functions of HA2
358(6)
Notes
364(3)
Solutions to selected exercises 367(12)
Bibliography 379(25)
Symbols and notations 404(4)
Index 408