Towards a clausal analysis of cut-elimination

• Autores: Alexander Leitsch, Matthias Baaz
• Localización: Journal of symbolic computation, ISSN 0747-7171, Vol. 41, Nº 3, 2006, págs. 381-410
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • In this paper we show that a large class of cut-elimination methods can be analysed by clause terms representing sets of characteristic clauses extractable from the original proof. Every reduction step of a cut-elimination procedure defines an operation on the corresponding clause term. Using this formal framework we prove that the methods of Gentzen and Tait and, more generally, every method based on a specific set of cut-reduction rules , yield a resolution proof which is subsumed by a resolution proof of the characteristic clause set. As a consequence we obtain that CERES (a resolution-based method of cut-elimination) is never inferior to any method based on . On the other hand we show that CERES is not optimal in general; instead there exist cut-reduction rules which efficiently simplify the set of characteristic clauses and thus produce much shorter proofs. Further improvements and pruning methods could thus be obtained by a structural (syntactic) analysis of the characteristic clause terms.