0 ratings 0% found this document useful (0 votes) 147 views 178 pages Basic Proof Theory
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content,
claim it here .
Available Formats
Download as PDF or read online on Scribd
Go to previous items Go to next items
Save Basic Proof Theory For Later BASIC PROOF THEORY Cambridge Tracts in Theoretical Computer Science
Editorial Board
‘S. Abramsky, Department of Computing Science, Edinburgh University
PIH. Aczel, Department of Computer Science, University of Manchester
IW. de Bakker, Centrum voor Wiskunde en Informatica, Amsterdam
LA. Goguen, Programming Research Group, University of Oxford
Y. Gurevich, Deparment of Electrical Engineering and Computer Science,
University of Michigan
IV. Tucker, Department of Mathematics and Computer Science,
University College of Swansea
Titles in the series
1.G.Chaitin Algorithmic Information Theory
2: LIC. Paulson Logie and Computation
3M. Spivey Understanding Z
4.6. Revest. Lambda Calculus, Combinaxors and Functional Programming
3.A. Ramsay Formal Methods in Artficial Intelligence
6.8. Vickers Topology via Logic
7.LN, Girard, ¥. Lafont & P, Taylor Proofs and Types
&.J. Clifford Formal Semantics & Pragmavics for Natural Language Processing
9! M4. Winslect Updating Logical Databases
10. K. McEvoy & 3.V. Tucker (eds) Theoretical Foundations of VLSI Design
LTH, Tse. A Unifying Framework for Stuctured Analysis and Design Models
12: G. Brewka Nonmonotonie Reasoning
1g. S{G. Noggar Mathematics for Computer Graphics
15. Dasgupta Design Theory and Computer Science
17, .C.M. Baeten (ed) Applications of Process Algebra
18, CM. Baeten & W. P. Weiland Process Algebra
19, M. Manzano. Extensions of First Order Logic
21,D.A. Wolftam The Clausal Theory of Types
221 V’ Stoltenberg-Hansen, I. Lindstrom & E. Griffor Mathematical Pheory af Domains
23. E-R. Olderog. Nets, Terns and Formuias
26. BID. Mosses Action Semantics
21. W.H, Hesselink Programs, Recursion and Unbounded Choice
29. P. Girdenfors (ed) Belief Revision
30. M. Ahoy & N. Biggs Computational Learning Theory
BITE Melham Higher Order Logic and Hardware Verificasion
32. RIL. Carpenter The Logic of Typed Feature Structures
33. EG. Manes Predicate Transformer Semantics
34, F-Nielson & HAR. Nielson Two Level Functional Languages
35.L-Feijs & I Jonkers Formal Specification and Design
36. S Mauw & G.I, Veluink (eds) Algebraic Specification of Communication Protocols
37. V. Stavridou Formal Methods in Circuit Design
38, NShankar Meaamachematics, Machines and Gadel’s Proof
39. 1B Pans. The Uncertain Reasoner's Companion
40: LDesel & IEsparza Free Choice Petri News
41, TJ. Ch, Meyer & W. van der Hoek Epistemic Logic for AI and Computer Science
42. CR. Hindley Basic Simple Type Theory
43. AS, Troelsira & H. Schwichtenbers Basie proof Theory
BASIC PROOF THEORY
AS.
. Troelstra
University of Amsterdam
H Schwichtenberg
Univ
S
ersity of Munich
CAMBRIDGE
UNIVERSITY PRESS
1B MS™
jd Published by the Press Syndicate of the University of Cambridge
‘The Pitt Building, Trumpington Street, Cambridge CB2 RP
40 West 20th Street, New York, NY 10011-4211, USA,
10 Stamford Road, Oakleigh, Melboume 3166, Australia
© Cambridge University Press 1996
First published 1996
Printed in Great Britain at the University Press. Cambridge
Library of Congress cataloguing in publication data available
British Library cataloguing in publication data available
ISBN 0521 57223 1 hardback
Contents
Preface
1 Introduction
1.1 Preliminaries
1.2. Simple type theories
1.3 Three types of formalism
2. N-systems and H-systems
2.1 Natural deduction systems
2.2 Nias aterm calculus
2.3 The relation between C, and M.
2.4 Hilbert systems
2.5 Notes
3. Gentzen systems
3.1 The Gl- and G2-systems
3.2 The Cut rule
3.3 Equivalence of G- and N-systems
3.4 Absorbing the structural rules
3.5. The one-sided systems for C
3.6 Notes
4 Cut elimination with applications
4.1, Cut elimination
4.2 Applications of cut elimination
4.3 Interpolation and definable functions
4.4 Some generalizations with applications
4.5. A more efficent calculus for Ip
46 Notes
5 Refinements
5.1 Numerical bounds on cut elimination
20
29
29
37
39
42
46
51
52
57
59
a
3
76
6
84
90
96
102
105
us
us.
