Breaking paths in atomic flows for classical logic

Alessio Guglielmi, Tom Gundersen, Lutz Straburger

Research output: Chapter or section in a book/report/conference proceedingChapter in a published conference proceeding

16 Citations (SciVal)
228 Downloads (Pure)

Abstract

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.
Original languageEnglish
Title of host publication2010 25th Annual IEEE Symposium on Logic in Computer Science, LICS
PublisherIEEE
Pages284-293
Number of pages10
ISBN (Electronic)9781424475896
ISBN (Print)9781424475889
DOIs
Publication statusPublished - Jul 2010
Event25th Annual IEEE Symposium on Logic in Computer Science, LICS 2010, July 11, 2010 - July 14, 2010 - Edinburgh, UK United Kingdom
Duration: 1 Jul 2010 → …

Publication series

NameProceedings - Symposium on Logic in Computer Science
ISSN (Print)1043-6871

Conference

Conference25th Annual IEEE Symposium on Logic in Computer Science, LICS 2010, July 11, 2010 - July 14, 2010
Country/TerritoryUK United Kingdom
CityEdinburgh
Period1/07/10 → …

Fingerprint

Dive into the research topics of 'Breaking paths in atomic flows for classical logic'. Together they form a unique fingerprint.

Cite this