Implicit exchange in multiplicative proofnets

Authors:
François Métayer
Affiliations:
Équipe PPS, Université Paris 7-CNRS, 2 place Jussieu, Case 7014 F75251 Paris Cedex 05. Email: metayer@logique.jussieu.fr
Venue:
Mathematical Structures in Computer Science
Year:
2001

Citing 3
Cited 4

Linear logic

Theoretical Computer Science
From proof-nets to interaction nets

Proceedings of the workshop on Advances in linear logic
Noncommutative proof nets

Proceedings of the workshop on Advances in linear logic

Two-dimensional proof-structures and the exchange rule

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
Permutative logic

CSL'05 Proceedings of the 19th international conference on Computer Science Logic

Quantified Score

Hi-index	0.00

Visualization

Abstract

Proofnets may be seen as orientable surfaces with boundary. We investigate how the topology of such nets relates to the number of exchange rules in corresponding proofs.