M. Acclavio and R. Maieli, Generalized Connectives for Multiplicative Linear Logic, 28th EACSL Annual Conference on Computer Science Logic, vol.2020, pp.1-6, 2020.
URL : https://hal.archives-ouvertes.fr/hal-02492258

G. Bellin, Subnets of proof-nets in multiplicative linear logic with MIX, Mathematical Structures in Computer Science, vol.7, pp.663-669, 1997.

G. Berry, Stable models of typed ?-calculi, Automata, Languages and Programming, pp.72-89, 1978.

K. Brünnler and A. Tiu, A Local System for Classical Logic, Logic for Programming, pp.347-361, 2001.

P. Bruscoli, A Purely Logical Account of Sequentiality in Proof Search, pp.302-316, 2002.

P. Bruscoli and L. Straßburger, On the Length of Medial-Switch-Mix Derivations, Logic, Language, Information, and Computation -24th International Workshop, vol.10388, pp.68-79, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01635933

C. Calk, A graph theoretical extension of boolean logic, 2016.

C. Calk, A. Das, and T. Waring, Beyond formulasas-cographs: an extension of Boolean logic to arbitrary graphs, 2020.

K. Chaudhuri, N. Guenot, and L. Straßburger, The Focused Calculus of Structures, CSL'11 (LIPIcs), Marc Bezem, vol.12, pp.159-173, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00772420

A. Stephen, R. A. Cook, and . Reckhow, The Relative Efficiency of Propositional Proof Systems, J. Symb. Log, vol.44, pp.36-50, 1979.

V. Danos and L. Regnier, The structure of the multiplicatives, Arch. Math. Log, vol.28, pp.181-203, 1989.

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) (LIPIcs), Maribel Fernández, vol.36, 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.9, pp.1-27, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01422611

A. Fleury and C. Retoré, The mix rule, Mathematical Structures in Computer Science, vol.4, pp.273-285, 1994.

J. Girard, Linear Logic, Theoretical Computer Science, vol.50, pp.1-102, 1987.
URL : https://hal.archives-ouvertes.fr/inria-00075966

J. Girard, On the meaning of logical rules II: multiplicatives and additives, NATO ASI Series F: Computer and Systems Sciences, vol.175, pp.183-212, 2000.

A. Guglielmi, A System of Interaction and Structure, ACM Transactions on Computational Logic, vol.8, pp.1-64, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00441254

A. Guglielmi, T. Gundersen, and M. Parigot, A Proof Calculus Which Reduces Syntactic Bureaucracy, Proceedings of the 21st International Conference on Rewriting Techniques and Applications, vol.6, pp.135-150, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00529301

A. Guglielmi and L. Straßburger, Non-commutativity and MELL in the Calculus of Structures, Computer Science Logic, Laurent Fribourg, pp.54-68, 2001.

A. Guglielmi and L. Straßburger, A Non-commutative Extension of MELL, Logic for Programming, pp.231-246, 2002.

A. Guglielmi and L. Straßburger, A system of interaction and structure V: the exponentials and splitting, Mathematical Structures in Computer Science, vol.21, pp.563-584, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00441254

R. Horne, The Sub-Additives: A Proof Theory for Probabilistic Choice extending Linear Logic, 4th International Conference on Formal Structures for Computation and Deduction, FSCD 2019, vol.131, p.16, 2019.

R. Horne and A. Tiu, Constructing weak simulations from linear implications for processes with private names, Mathematical Structures in Computer Science, vol.29, pp.1275-1308, 2019.

R. Horne, A. Tiu, B. Aman, and G. Ciobanu, De Morgan Dual Nominal Quantifiers Modelling Private Names in Non-Commutative Logic, ACM Trans. Comput. Log, vol.20, pp.1-22, 2019.

H. William-alvin, Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pp.479-490, 1980.

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

N. Kobayashi and A. Yonezawa, ACL -a Concurrent Linear Logic Programming Paradigm, Proceedings of the 1993 International Symposium on Logic Programming (ILPS '93), pp.279-294, 1993.

K. Lodaya and P. Weil, Series-parallel languages and the bounded-width property, Theoretical Computer Science, vol.237, pp.31-32, 2000.

M. Ross, J. P. Mcconnell, and . Spinrad, Linear-Time Modular Decomposition and Efficient Transitive Orientation of Comparability Graphs, Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '94), pp.536-545, 1994.

D. Miller, The ? -calculus as a theory in linear logic: Preliminary results, Extensions of Logic Programming, pp.242-264, 1993.

D. Miller, G. Nadathur, F. Pfenning, and A. Scedrov, Uniform proofs as a foundation for logic programming, Annals of Pure and Applied logic, vol.51, issue.91, p.90068, 1991.

R. H. Möhring, Computationally Tractable Classes of Ordered Sets, pp.105-193, 1989.

M. Nielsen, G. Plotkin, and G. Winskel, Petri nets, event structures and domains, part I, Theoretical Computer Science, vol.13, pp.85-108, 1981.

C. Adam and P. , Interpretations of net theory, Comput. Surveys, vol.9, pp.223-252, 1977.

F. Poggiolesi, A cut-free simple sequent calculus for modal logic S5, The Review of Symbolic Logic, vol.1, pp.3-15, 2008.
URL : https://hal.archives-ouvertes.fr/halshs-00775809

V. Pratt, Modeling concurrency with partial orders, International Journal of Parallel Programming, vol.15, pp.33-71, 1986.

C. Retoré, Pomset logic: A non-commutative extension of classical linear logic, pp.300-318, 1997.

C. Retoré, Handsome proof-nets: perfect matchings and cographs, Theoretical Computer Science, vol.294, pp.473-488, 2003.

P. Stouppa, A deep inference system for the modal logic S5, Studia Logica, vol.85, pp.199-214, 2007.

L. Straßburger, A Local System for Linear Logic, Logic for Programming, pp.388-402, 2002.

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

L. Straßburger, Combinatorial Flows and Their Normalisation, 2nd International Conference on Formal Structures for Computation and Deduction, vol.84, pp.1-31, 2017.

A. Tiu, A System of Interaction and Structure II: The Need for Deep Inference, Logical Methods in Computer Science, vol.2, issue.2, pp.1-24, 2006.

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

T. W. , A Graph theoretic extension of Boolean logic, 2019.