One advantage of paraconsistent logic is that it can deal with inconsistencies without making the system trivial. However, unlike classical propositional calculus, its deductive system is limited, and the meaning of paraconsistent negation is still not clear. This article presents a logical system that brings together the strengths of both approaches. The Propositional Calculus with Multiple Negations $\left(\textbf{CPN}_{n}\right)$ is a generalization of classical propositional logic in which a finite number of negations (each weaker than the classical one but with similar behavior) are added. This makes it possible to introduce weak inconsistencies in a controlled way without leading to triviality.