Free Computer, Mathematics, Technical Books and Lecture Notes, etc.
- Title Normalization, Cut-Elimination, and the Theory of Proofs
- Authors A. M. Ungar
- Publisher: Center for the Study of Language and Inf; 1 edition (June 10, 1992)
- Paperback: 236 pages
- eBook: PDF, 245 page, 70.3 MB
- Language: English
- ISBN-10: 0937073822
- ISBN-13: 978-0937073827
- Share This:
Gentzen's cut-elimination theorem is widely used as a tool for meta-mathematical investigations. It is sometimes claimed however that the theorem and its proof have interest which is independent of these applications and derives from the information they supply about the structure of proofs in general.
Ungar investigates this claim in the context of first order logic. Ungar gives an account of Gentzen's theorem for various formalisms and discusses the difficulties involved in treating these different versions uniformly, as instances of a single theorem which is not tied to a particular system of rules. By extending the theorem to a natural deduction calculus whose derivations are allowed to have more than one conclusion, Ungar argues that the different versions of the theorem are more or less natural specializations of a single result whose significance can be understood in terms of the proofs represented by formal derivations.
A concluding discussion focuses on the relationship between proofs and formal derivations, and the role proofs may play as part of a general theory of evidence.About the Authors
- Mathematical Logic - Set Theory, Model Theory, Computability, etc
- Theory of Programming Languages
- Theory of Computation
- Introduction to Computer Science