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

G. Bellin and J. Van-de-wiele, Subnets of proof-nets in MLL´.MLL´MLL´

Y. Girard, L. Lafont, and . Regnier, Advances in Linear Logic, pp.249-270, 1995.
DOI : 10.1017/CBO9780511629150

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

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

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

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.

P. Curien, Categorical combinators, Information and Control, vol.69, issue.1-3, pp.188-25410, 1986.
DOI : 10.1016/S0019-9958(86)80047-X
URL : https://doi.org/10.1016/s0019-9958(86)80047-x

V. Danos and L. Regnier, The structure of multiplicatives, Archive for Mathematical Logic, vol.28, issue.3, pp.181-203, 1989.
DOI : 10.1007/BF01622878

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.

J. Duffin, Topology of series-parallel networks, Journal of Mathematical Analysis and Applications, vol.10, issue.2, pp.303-318, 1965.
DOI : 10.1016/0022-247X(65)90125-3
URL : https://doi.org/10.1016/0022-247x(65)90125-3

J. 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 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 : https://lmcs.episciences.org/1081/pdf

A. 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

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
DOI : 10.1016/0001-8708(91)90003-P
URL : https://hal.archives-ouvertes.fr/hal-01092253

D. Hughes, Simple multiplicative proof nets with units. Preprint URL: http: //arxiv.org/abs/math, p.507003, 2005.

D. Hughes, Proofs without syntax, Annals of Mathematics, vol.164, issue.3, pp.1065-1076, 2006.
DOI : 10.4007/annals.2006.164.1065
URL : http://annals.math.princeton.edu/wp-content/uploads/annals-v164-n3-p09.pdf

D. 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 : https://doi.org/10.1016/j.entcs.2006.05.036

D. Hughes, First-order proofs without syntax, p.19, 2014.
DOI : 10.4007/annals.2006.164.1065
URL : http://annals.math.princeton.edu/wp-content/uploads/annals-v164-n3-p09.pdf

G. Maxwell, K. , and S. M. Lane, Coherence in closed categories, J. of Pure and Applied Algebra, vol.1, pp.97-140, 1971.

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

F. 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

O. 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

. Miller, A Proposal for Broad Spectrum Proof Certificates, CPP: First International Conference on Certified Programs and Proofs, pp.54-69, 2011.
DOI : 10.1007/978-3-540-88387-6_3
URL : https://hal.archives-ouvertes.fr/hal-00772722

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.1016/j.apal.2012.07.004
URL : https://hal.archives-ouvertes.fr/hal-00925707

C. Retoré, Handsome proof-nets: perfect matchings and cographs, Theoretical Computer Science, vol.294, issue.3, pp.473-488, 1993.
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, 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.

L. Straßburger, Combinatorial Flows and Proof Compression Research Report RR-9048, Inria Saclay URL: https, 2017.

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

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