Methods of Cut-Elimination

Matthias Baaz

ISBN 10: 9400734972 / ISBN 13: 9789400734975

Published by Springer, Springer, 2013

About this Item

Druck auf Anfrage Neuware - Printed after ordering - This is the first book on cut-elimination in first-order predicate logic from an algorithmic point of view. Instead of just proving the existence of cut-free proofs, it focuses on the algorithmic methods transforming proofs with arbitrary cuts to proofs with only atomic cuts (atomic cut normal forms, so-called ACNFs). The first part investigates traditional reductive methods from the point of view of proof rewriting. Within this general framework, generalizations of Gentzen's and Sch'utte-Tait's cut-elimination methods are defined and shown terminating with ACNFs of the original proof. Moreover, a complexity theoretic comparison of Gentzen's and Tait's methods is given.The core of the book centers around the cut-elimination method CERES (cut elimination by resolution) developed by the authors. CERES is based on the resolution calculus and radically differs from the reductive cut-elimination methods. The book shows that CERES asymptotically outperforms all reductive methods based on Gentzen's cut-reduction rules. It obtains this result by heavy use of subsumption theorems in clause logic. Moreover, several applications of CERES are given (to interpolation, complexity analysis of cut-elimination, generalization of proofs, and to the analysis of real mathematical proofs). Lastly, the book demonstrates that CERES can be extended to nonclassical logics, in particular to finitely-valued logics and to G'odel logic.

Seller Inventory # 9789400734975

Bibliographic Details

• Title: Methods of Cut-Elimination
• Publisher: Springer, Springer
• Publication Date: 2013
• Language: English
• ISBN 10: 9400734972
• ISBN 13: 9789400734975
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 235W x 155H x 17D millimeters 235 millimeters width by 155 millimeters height by 17 millimeters depth
• Weight: 452 grams

About this title

Synopsis

This is the first book on cut-elimination in first-order predicate logic from an algorithmic point of view. Instead of just proving the existence of cut-free proofs, it focuses on the algorithmic methods transforming proofs with arbitrary cuts to proofs with only atomic cuts (atomic cut normal forms, so-called ACNFs). The first part investigates traditional reductive methods from the point of view of proof rewriting. Within this general framework, generalizations of Gentzen's and Sch\”utte-Tait's cut-elimination methods are defined and shown terminating with ACNFs of the original proof. Moreover, a complexity theoretic comparison of Gentzen's and Tait's methods is given.

The core of the book centers around the cut-elimination method CERES (cut elimination by resolution) developed by the authors. CERES is based on the resolution calculus and radically differs from the reductive cut-elimination methods. The book shows that CERES asymptotically outperforms all reductive methods based on Gentzen's cut-reduction rules. It obtains this result by heavy use of subsumption theorems in clause logic. Moreover, several applications of CERES are given (to interpolation, complexity analysis of cut-elimination, generalization of proofs, and to the analysis of real mathematical proofs). Lastly, the book demonstrates that CERES can be extended to nonclassical logics, in particular to finitely-valued logics and to G\"odel logic.

About the Author

Matthias Baaz is professor of logical foundations of computer science at the Vienna University of Technology. He obtained his Ph.D. in mathematical logic at the University of Vienna and habilitation at the Vienna University of Technology. His main field of research is proof theory in classical and nonclassical logics.

Alexander Leitsch is professor of mathematics and theoretical computer science at the Vienna University of Technology. He obtained his Ph.D. in mathematics at the University of Vienna and habilitation at the University of Linz. His research areas are automated deduction and computational proof theory.