## Streams and Strings in Formal Proofs

by
n.n.

by
n.n.

@MISC{n.n._streamsand,

author = {n.n.},

title = {Streams and Strings in Formal Proofs},

year = {}

}

Streams are acyclic directed subgraphs of the logical flow graph of a proof and represent bundles of paths with the same origin and the same end. Streams can be described with a natural algebraic formalism which allows to explain in algebraic terms the evolution of proofs during cutelimination. In our approach, "logic" is often forgotten and combinatorial properties of graphs are taken into account to explain logical phenomena.

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2015 The Pennsylvania State University