A Proof Calculus Which Reduces Syntactic Bureaucracy

In usual proof systems, like the sequent calculus, only a very limited way of combining proofs is available through the tree structure. We present in this paper a logicindependent proof calculus, where proofs can be freely composed by connectives, and prove its basic properties. The main advantage of this proof calculus is that it allows to avoid certain types of syntactic bureaucracy inherent to all usual proof systems, in particular the sequent calculus. Proofs in this system closely reflect their atomic flow, which traces the behaviour of atoms through structural rules. The general definition is illustrated by the standard deep-inference system for propositional logic, for which there are known rewriting techniques that achieve cut elimination based only on the information in atomic flows.

• Type: Conference
• Year: 2010
• Where: RTA
• Authors: Alessio Guglielmi, Tom Gundersen, Michel Parigot
• Keywords: Proof Calculus, RTA 2010, Sequent Calculus, Theoretical Computer Science, Usual Proof Systems