Theoretical Computer Science
Phase semantics and sequent calculus for pure noncommutative classical linear propositional logic
Journal of Symbolic Logic
Proceedings of the workshop on Advances in linear logic
Proceedings of the workshop on Advances in linear logic
Proceedings of the workshop on Advances in linear logic
Graphs and Hypergraphs
Handsome proof-nets: perfect matchings and cographs
Theoretical Computer Science - Linear logic
| Hi-index | 0.00 |
We define proof nets for cyclic multiplicative linear logic as edge bi-coloured graphs.Our characterization is purely graph theoreticaland works without further complication for proof nets with cuts, which are usually harder to handle in the non-commutative case. This also provides a new characterization of the proof nets for the Lambek calculus (with the empty sequence) which simply are a restriction on the formulas to be considered(which are asked to be intuitionistic).