A Sequent Calculus with Implicit Term Representation [chapter]

Stefan Hetzl
2010 Lecture Notes in Computer Science  
We investigate a modification of the sequent calculus which separates a first-order proof into its abstract deductive structure and a unifier which renders this structure a valid proof. We define a cutelimination procedure for this calculus and show that it produces the same cut-free proofs as the standard calculus, but, due to the implicit representation of terms, it provides exponentially shorter normal forms. This modified calculus is applied as a tool for theoretical analyses of the
more » ... calculus and as a mechanism for a more efficient implementation of cut-elimination.
doi:10.1007/978-3-642-15205-4_28 fatcat:o5ctxuk5rrb6lizbbcau7kdrgq