 NP, PSPACE, and EXPSPACE are complexity classes such that NP \(\subseteq\) PSPACE \(\subseteq\) EXPSPACE. Surprisingly, for those that may forget that the novelty in linear logic lies in the way formulas are managed without the structural rules of contraction and weakening,  these results stay the same even if we focus on the fragments of the logics where only the constants, and no propositional variables, are allowed (Kanovich 1994,  Lincoln &amp; Winkler 1994). Indeed, it is possible to encode arbitrary formulas into constant-only formulas preserving provability.