Results

**1 - 4**of**4**### 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.

### Propositional Proofs via Combinatorial Geometry and the Search for Symmetry

- IN ANNALS OF THE KURT GODEL SOCIETY, INSTITUTE OF COMPUTER SCIENCE AS CR
, 1999

"... This paper is motivated by questions of complexity and combinatorics of proofs in the sequent calculus. We shall pay particular attention to the role that symmetry plays in these questions.. We want to ..."

Abstract
- Add to MetaCart

This paper is motivated by questions of complexity and combinatorics of proofs in the sequent calculus. We shall pay particular attention to the role that symmetry plays in these questions.. We want to