Fr. 85.00

Normalization, Cut-Elimination, and the Theory of Proofs

English · Hardback

Shipping usually within 3 to 5 weeks (title will be specially ordered)

Description

Read more










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.

Product details

Authors A. M. Ungar, A.m Ungar
Publisher Gardners
 
Languages English
Product format Hardback
Released 01.01.1992
 
EAN 9780937073834
ISBN 978-0-937073-83-4
No. of pages 236
Weight 573 g
Series CSLI Lecture Notes
Lecture Notes
Subjects Humanities, art, music > Linguistics and literary studies > General and comparative linguistics
Natural sciences, medicine, IT, technology > Mathematics > Basic principles

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.

For messages to CeDe.ch please use the contact form.

The input fields marked * are obligatory

By submitting this form you agree to our data privacy statement.