A proof calculus which reduces syntactic bureaucracy

Alessio Guglielmi, Tom Gundersen, M Parigot

Research output: Chapter in Book/Report/Conference proceedingChapter

19 Citations (Scopus)
46 Downloads (Pure)

Abstract

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 logic-independent 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.
Original languageEnglish
Title of host publicationProceedings of the 21st International Conference on Rewriting Techniques and Applications
Place of PublicationDagstuhl, Germany
PublisherLeibniz International Proceedings in Informatics
Pages135-150
Number of pages16
Volume6
DOIs
Publication statusPublished - 2010

Fingerprint Dive into the research topics of 'A proof calculus which reduces syntactic bureaucracy'. Together they form a unique fingerprint.

  • Cite this

    Guglielmi, A., Gundersen, T., & Parigot, M. (2010). A proof calculus which reduces syntactic bureaucracy. In Proceedings of the 21st International Conference on Rewriting Techniques and Applications (Vol. 6, pp. 135-150). Leibniz International Proceedings in Informatics. https://doi.org/10.4230/LIPIcs.RTA.2010.135