Cut Elimination in Deduction Modulo by Abstract Completion 1st Edition by Guillaume Burel, Claude Kirchner – Ebook PDF Instant Download/Delivery. 9783540727347
Full download Cut Elimination in Deduction Modulo by Abstract Completion 1st Edition after payment
Product details:
ISBN 10:
ISBN 13: 9783540727347
Author: Guillaume Burel, Claude Kirchner
Deduction Modulo implements Poincarés principle by identifying deduction and computation as different paradigms and making their interaction possible. This leads to logical systems like the sequent calculus or natural deduction modulo. Even if deduction modulo is logically equivalent to first-order logic, proofs in such systems are quite different and dramatically simpler with one cost: cut elimination may not hold anymore. We prove first that it is even undecidable to know, given a congruence over propositions, if cuts can be eliminated in the sequent calculus modulo this congruence.
Second, to recover the cut admissibility, we show how computation rules can be added following the classical idea of completion a la Knuth and Bendix. Because in deduction modulo, rewriting acts on terms as well as on propositions, the objects are much more elaborated than for standard completion. Under appropriate hypothesis, we prove that the sequent calculus modulo is an instance of the powerful framework of abstract canonical systems and that therefore, cuts correspond to critical proofs that abstract completion allows us to eliminate.
In addition to an original and deep understanding of the interactions between deduction and computation and of the expressivity of abstract canonical systems, this provides a mechanical way to transform a sequent calculus modulo into an equivalent one admitting the cut rule, therefore extending in a significant way the applicability of mechanized proof search in deduction modulo.
Cut Elimination in Deduction Modulo by Abstract Completion 1st Table of contents:
Background and Motivation
Deduction Modulo: Concepts and Formalism
Cut Elimination in Proof Theory
Abstract Completion: Definition and Methodology
Cut Elimination in Deduction Modulo
Application of Abstract Completion to Cut Elimination
Theoretical Results and Proofs
Implementation and Case Studies
Evaluation and Performance
Challenges and Limitations
Future Directions
People also search for Cut Elimination in Deduction Modulo by Abstract Completion 1st:
cut elimination in deduction modulo
cut elimination theorem
cut elimination proof
cut elimination
elimination cut