TY - JOUR

T1 - Normalisation control in deep inference via atomic flows

AU - Guglielmi, Alessio

AU - Gundersen, T

PY - 2008/3/31

Y1 - 2008/3/31

N2 - We introduce `atomic flows': they are graphs obtained from derivations by tracing atom occurrences and forgetting the logical structure. We study simple manipulations of atomic flows that correspond to complex reductions on derivations. This allows us to prove, for propositional logic, a new and very general normalisation theorem, which contains cut elimination as a special case. We operate in deep inference, which is more general than other syntactic paradigms, and where normalisation is more difficult to control. We argue that atomic flows are a significant technical advance for normalisation theory, because 1) the technique they support is largely independent of syntax; 2) indeed, it is largely independent of logical inference rules; 3) they constitute a powerful geometric formalism, which is more intuitive than syntax.

AB - We introduce `atomic flows': they are graphs obtained from derivations by tracing atom occurrences and forgetting the logical structure. We study simple manipulations of atomic flows that correspond to complex reductions on derivations. This allows us to prove, for propositional logic, a new and very general normalisation theorem, which contains cut elimination as a special case. We operate in deep inference, which is more general than other syntactic paradigms, and where normalisation is more difficult to control. We argue that atomic flows are a significant technical advance for normalisation theory, because 1) the technique they support is largely independent of syntax; 2) indeed, it is largely independent of logical inference rules; 3) they constitute a powerful geometric formalism, which is more intuitive than syntax.

UR - http://www.scopus.com/inward/record.url?scp=58049104083&partnerID=8YFLogxK

UR - http://dx.doi.org/10.2168/LMCS-4(1:9)2008

U2 - 10.2168/LMCS-4(1:9)2008

DO - 10.2168/LMCS-4(1:9)2008

M3 - Article

SN - 1860-5974

VL - 4

SP - 1

EP - 36

JO - Logical Methods in Computer Science

JF - Logical Methods in Computer Science

IS - 1

M1 - 9

ER -