Decidability of linear affine logic

The propositional linear logic is known to be undecidable. We prove that the full propositional linear affine logic containing all multiplicatives, additives, exponentials, and constants is decidable. The proof is based on a reduction of linear affine logic to sequents of specific “normal forms”, and on a generalization of M.I. Kanovich´s (1992) computational interpretation of linear logic adaptive to these “normal forms”