This talk addresses the following questions:
1) what is a generalized (n-ary) connective of the multiplicative fragment of linear logic (MLL)?
2) are there generalized connectives that cannot be defined by those primitive binary ones (Tensor and Par)?
3) is there a way to sequentialize proof-nets containing two orthogonal generalized non binary-definable conclusions?