B. Peter and . Andrews, Refutations by matings, IEEE Transactions on Computers, issue.25, pp.801-807, 1976.

P. Bruscoli and A. Guglielmi, On the proof complexity of deep inference, ACM Transactions on Computational Logic, vol.10, issue.2, pp.1-34, 2009.
DOI : 10.1145/1462179.1462186

URL : https://hal.archives-ouvertes.fr/inria-00441211

[. Bibel, On Matrices with Connections, Journal of the ACM, vol.28, issue.4, pp.633-645, 1981.
DOI : 10.1145/322276.322277

G. Boolos, Don't eliminate cut, Journal of Philosophical Logic, vol.13, issue.4, pp.373-378, 1984.
DOI : 10.1007/BF00247711

K. Brünnler and A. Tiu, A Local System for Classical Logic, LNAI, vol.2250, pp.347-361, 2001.
DOI : 10.1007/3-540-45653-8_24

R. Samuel and . Buss, The undecidability of k-provability. Annals of Pure and Applied Logic, pp.72-102, 1991.

[. Bellin and J. Van-de-wiele, Subnets of proofnets in MLL´.MLL´MLL´, Advances in Linear Logic, pp.249-270, 1995.

A. Carbone, Interpolants, cut elimination and flow graphs for the propositional calculus, Annals of Pure and Applied Logic, vol.83, issue.3, pp.249-299, 1997.
DOI : 10.1016/S0168-0072(96)00019-X

URL : http://doi.org/10.1016/s0168-0072(96)00019-x

G. Derek, Y. Corneil, L. K. Perl, and . Stewart, A linear recognition algorithm for cographs, SIAM J. Comput, vol.14, issue.4, pp.926-934, 1985.

A. Stephen, R. A. Cook, and . Reckhow, The relative efficiency of propositional proof systems, The Journal of Symbolic Logic, vol.44, issue.1, pp.36-50, 1979.

[. Curien, Categorical combinators, Information and Control, vol.69, issue.1-3, pp.188-254, 1986.
DOI : 10.1016/S0019-9958(86)80047-X

URL : http://doi.org/10.1016/s0019-9958(86)80047-x

A. Das, Rewriting with linear inferences in propositional logic, 24th International Conference on Rewriting Techniques and Applications (RTA), volume 21 of Leibniz International Proceedings in Informatics (LIPIcs), pp.158-173, 2013.

V. Danos, L. Regnierduf65, and ]. R. Duffin, The structure of multiplicatives Topology of series-parallel networks, Annals of Mathematical Logic Journal of Mathematical Analysis and Applications, vol.28, issue.102, pp.181-203303, 1965.

A. Guglielmi and T. Gundersen, Normalisation Control in Deep Inference via Atomic Flows, Logical Methods in Computer Science, vol.4, issue.1, pp.1-36, 2008.
DOI : 10.2168/LMCS-4(1:9)2008

URL : http://arxiv.org/abs/0709.1205

[. Guglielmi, T. Gundersen, and L. Straßburger, Breaking Paths in Atomic Flows for Classical Logic, 2010 25th Annual IEEE Symposium on Logic in Computer Science, 2010.
DOI : 10.1109/LICS.2010.12

URL : https://hal.archives-ouvertes.fr/hal-00541076

[. Girard, Linear logic, Theoretical Computer Science, vol.50, issue.1, pp.1-102, 1987.
DOI : 10.1016/0304-3975(87)90045-4

URL : https://hal.archives-ouvertes.fr/inria-00075966

A. Guglielmi and L. Straßburger, Non-commutativity and MELL in the Calculus of Structures, Computer Science Logic LNCS, vol.2142, pp.54-68, 2001.
DOI : 10.1007/3-540-44802-0_5

S. Guerrini, Correctness of multiplicative proof nets is linear, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158), pp.454-463, 1999.
DOI : 10.1109/LICS.1999.782640

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.495.6667

A. Guglielmi, A system of interaction and structure, ACM Transactions on Computational Logic, vol.8, issue.1, pp.1-64, 2007.
DOI : 10.1145/1182613.1182614

URL : https://hal.archives-ouvertes.fr/inria-00441214

W. Heijltjes and L. Straßburger, Proof nets and semi-star-autonomous categories, Mathematical Structures in Computer Science, vol.49, issue.05, pp.789-828, 2016.
DOI : 10.1016/0001-8708(91)90003-P

URL : https://hal.archives-ouvertes.fr/hal-01092253

[. Hughes, Simple multiplicative proof nets with units, 2005.

D. Hug06a and . Hughes, Proofs Without Syntax, Annals of Mathematics, vol.164, issue.3, pp.1065-1076, 2006.

[. Hughes, Towards Hilbert's 24th Problem: Combinatorial Proof Invariants, Electronic Notes in Theoretical Computer Science, vol.165, pp.37-63, 2006.
DOI : 10.1016/j.entcs.2006.05.036

URL : http://doi.org/10.1016/j.entcs.2006.05.036

[. Hughes, First-order proofs without syntax, 2014.
DOI : 10.4007/annals.2006.164.1065

[. Kelly and S. M. Lane, Coherence in closed categories, Journal of Pure and Applied Algebra, vol.1, issue.1, pp.97-140, 1971.
DOI : 10.1016/0022-4049(71)90013-2

URL : http://dx.doi.org/10.1016/0022-4049(71)90013-2

J. Krají?ek and P. Pudlák, Abstract, The Journal of Symbolic Logic, vol.1130, issue.03, pp.1063-1079, 1989.
DOI : 10.1016/0304-3975(85)90144-6

[. Laurent, Polarized proof-nets: proof-nets for LC (extended abstract), Typed Lambda Calculi and Applications, pp.213-227, 1999.
DOI : 10.1007/3-540-48959-2_16

[. Laurent, Polarized proof-nets and ????-calculus, Theoretical Computer Science, vol.290, issue.1, pp.161-188, 2003.
DOI : 10.1016/S0304-3975(01)00297-3

URL : https://hal.archives-ouvertes.fr/hal-00009114

[. Lamarche and L. Straßburger, Naming Proofs in Classical Propositional Logic, TLCA'05, pp.246-261, 2005.
DOI : 10.1007/11417170_19

URL : https://hal.archives-ouvertes.fr/hal-00012294

R. H. Möhring, Computationally Tractable Classes of Ordered Sets, Algorithms and Order, pp.105-194, 1989.
DOI : 10.1007/978-94-009-2639-4_4

N. Novakovic and L. Straßburger, On the Power of Substitution in the Calculus of Structures, ACM Transactions on Computational Logic, vol.16, issue.3, p.19, 2015.
DOI : 10.1145/2701424

URL : https://hal.archives-ouvertes.fr/hal-00925707

[. Retoré, Réseaux et Séquents Ordonnés, 1993.

[. Retoré, Handsome proof-nets: perfect matchings and cographs, Theoretical Computer Science, vol.294, issue.3, pp.473-488, 2003.
DOI : 10.1016/S0304-3975(01)00175-X

E. P. Robinson, Proof Nets for Classical Logic, Journal of Logic and Computation, vol.13, issue.5, pp.777-797, 2003.
DOI : 10.1093/logcom/13.5.777

L. Straßburger, Linear Logic and Noncommutativity in the Calculus of Structures, 2003.

L. Straßburger, MELL in the calculus of structures, Theoretical Computer Science, vol.309, issue.1-3, pp.213-285, 2003.
DOI : 10.1016/S0304-3975(03)00240-8

L. Straßburger, A characterisation of medial as rewriting rule, Term Rewriting and Applications , RTA'07, pp.344-358

L. Straßburger, From Deep Inference to Proof Nets via Cut Elimination, Journal of Logic and Computation, vol.21, issue.4, pp.589-624, 2011.
DOI : 10.1093/logcom/exp047

L. Straßburger, Extension without cut. Annals of Pure and Applied Logic, 1995.

A. Sjerp, T. , and H. Schwichtenberg, Basic Proof Theory, 2000.

]. G. Tse68 and . Tseitin, On the complexity of derivation in propositional calculus, Zapiski Nauchnykh Seminarou LOMI, vol.8, pp.234-259, 1968.