Guglielmi, A., Gundersen, T. and Straburger, L., 2010. Breaking paths in atomic flows for classical logic. In: 25th Annual IEEE Symposium on Logic in Computer Science, LICS 2010, July 11, 2010 - July 14, 2010, 2010-07-01. IEEE, pp. 284-293. (Proceedings - Symposium on Logic in Computer Science)
This work belongs to a wider effort aimed at eliminating syntactic bureaucracy from proof systems. In this paper, we present a novel cut elimination procedure for classical propositional logic. It is based on the recently introduced atomic flows: they are purely graphical devices that abstract away from much of the typical bureaucracy of proofs. We make crucial use of the path breaker, an atomic-flow construction that avoids some nasty termination problems, and that can be used in any proof system with sufficient symmetry. This paper contains an original 2-dimensional-diagram exposition of atomic flows, which helps us to connect atomic flows with other known formalisms.
|Item Type ||Conference or Workshop Items (UNSPECIFIED)|
|Creators||Guglielmi, A., Gundersen, T. and Straburger, L.|
|Departments||Faculty of Science > Computer Science|
|Publisher Statement||AFII.pdf: © 2010 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works|
|Additional Information||25th Annual IEEE Symposium on Logic in Computer Science, LICS 2010. 11-14 July 2010. Edinburgh, UK.|
Actions (login required)