Expressing additives using multiplicatives and subexponentials.

Subexponential logic is a variant of linear logic with a family of exponential connectives – called <italic>subexponentials</italic> – that are indexed and arranged in a pre-order. Each subexponential has or lacks associated structural properties of weakening and contraction. We show that a classical propositional multiplicative subexponential logic (<italic>MSEL</italic>) with one unrestricted and two linear subexponentials can encode the halting problem for two register Minsky machines, and is hence undecidable. We then show how the additive connectives can be directly simulated by giving an encoding of propositional multiplicative additive linear logic (<italic>MALL</italic>) in an <italic>MSEL</italic> with one unrestricted and four linear subexponentials. [ABSTRACT FROM AUTHOR]