Theoretical Computer Science
Implicit exchange in multiplicative proofnets
Mathematical Structures in Computer Science
Permutative additives and exponentials
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Rewriting systems for the surface classification theorem
Mathematical Structures in Computer Science
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
| Hi-index | 0.00 |
In the paper Métayer (2001), Métayer transforms multiplicative proof-structures into orientable surfaces with boundaries. He investigates the link between the topological complexity and the number of exchanges in a sequentialisation. The theorem he achieves is about a particular rule of exchange (transpositions by blocks). We complete his approach by showing that the topological complexity does not provide any information in other cases (arbitrary exchange, upper bound of the number of exchanges). Then, we show that, on the other hand, the surface associated to a proof-structure is the surface of minimal complexity on which the proof can be drawn without crossing and respecting the local orientation.