Equal Rights for the Cut: Computable Non-analytic Cuts in Cut-based Proofs

This work studies the structure of proofs containing non-analytic cuts in the cut-based system, a sequent inference system in which the cut rule is not eliminable and the only branching rule is the cut. Such sequent system is invertible, leading to the KE-tableau decision method. We study the structure of such proofs, proving the existence of a normal form for them in the form of a comb-tree proof. We then concentrate on the problem of efficiently computing non-analytic cuts. For that, we study the generalisation of techniques present in many modern theorem provers, namely the techniques of conflict-driven formula learning.

• Type: Journal
• Year: 2007
• Where: IGPL
• Authors: Marcelo Finger, Dov M. Gabbay
• Keywords: IGPL 2007, KE-tableau Decision Method, Non-analytic Cuts, Sequent Inference