Results

**1 - 3**of**3**### INTRODUCTION TO THE COMBINATORICS AND COMPLEXITY OF CUT ELIMINATION

"... Abstract. Modus Ponens says that if you know A and you know that A implies B, then you know B. This is a basic rule that we take for granted ..."

Abstract
- Add to MetaCart

Abstract. Modus Ponens says that if you know A and you know that A implies B, then you know B. This is a basic rule that we take for granted

### Streams and Strings in Formal Proofs

"... 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. ..."

Abstract
- Add to MetaCart

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.