D. Bechet, P. De-groote, and C. Retoré, A complete axiomatisation for the inclusion of series-parallel partial orders, Rewriting Techniques and Applications, pp.230-240, 1997.
DOI : 10.1007/3-540-62950-5_74

R. Blute, R. Cockett, R. Seely, and T. Trimble, Natural deduction and coherence for weakly distributive categories, Journal of Pure and Applied Algebra, vol.113, issue.3, pp.229-296, 1996.
DOI : 10.1016/0022-4049(95)00159-X

URL : https://doi.org/10.1016/0022-4049(95)00159-x

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, A Purely Logical Account of Sequentiality in Proof Search, Logic Programming, 18th International Conference, pp.302-316, 2002.
DOI : 10.1007/3-540-45619-8_21

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

P. Bruscoli, A. Guglielmi, T. Gundersen, and M. Parigot, A Quasipolynomial Cut-Elimination Procedure in Deep Inference via Atomic Flows and Threshold Formulae, LPAR-16, pp.136-153, 2010.
DOI : 10.1145/1182613.1182614

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

P. Bruscoli, A. Guglielmi, T. Gundersen, and M. Parigot, Quasipolynomial Normalisation in Deep Inference via Atomic Flows and Threshold Formulae, Logical Methods in Computer Science, vol.12, issue.2, pp.121-151, 2016.
DOI : 10.2168/LMCS-12(2:5)2016

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

A. Das, Complexity of Deep Inference via Atomic Flows, Computability in Europe, pp.139-150, 2012.
DOI : 10.1007/978-3-642-30870-3_15

URL : http://www.anupamdas.com/items/RelComp/RelComp.pdf

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.

A. Das and L. Straßburger, No complete linear term rewriting system for propositional logic, 26th International Conference on Rewriting Techniques and Applications, RTA 2015, pp.127-142, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01236948

A. Das and L. Straßburger, On linear rewriting systems for Boolean logic and some applications to proof theory, Logical Methods in Computer Science, vol.12, issue.4, p.2016
DOI : 10.2168/LMCS-12(4:9)2016

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

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-00441254

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

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

T. Gundersen, W. Heijltjes, and M. Parigot, Atomic Lambda Calculus: A Typed Lambda-Calculus with Explicit Sharing, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, pp.311-320, 2013.
DOI : 10.1109/LICS.2013.37

O. Kahramanogullari, Interaction and Depth against Nondeterminism in Proof Search, Logical Methods in Computer Science, vol.10, issue.2, p.2014
DOI : 10.2168/LMCS-10(2:5)2014

URL : https://lmcs.episciences.org/1089/pdf

F. Lamarche, Exploring the gap between linear and classical logic, Theory and Applications of Categories, vol.18, issue.18, pp.473-535, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00113785

L. Straßburger, A local system for linear logic, Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2002, pp.388-402, 2002.

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

L. Straßburger, On the axiomatisation of Boolean categories with and without medial, Theory and Applications of Categories, vol.18, issue.18, pp.536-601, 2007.

A. Tubella, A study of normalisation through subatomic logic, 2016.