  Isomorphism between formulae is defined with respect to categories
formalizing equality of deductions in classical propositional logic and in the
multiplicative fragment of classical linear propositional logic caught by proof
nets. This equality is motivated by generality of deductions. Characterizations
are given for pairs of isomorphic formulae, which lead to decision procedures
for this isomorphism.
