This chapter presents a detailed algebraic investigation of the Cn-Calculus developed by Newton da Costa, one of the foundational systems in paraconsistent logic. Unlike classical logic, which collapses in the face of contradictions, the Cn systems tolerate inconsistency through a controlled weakening of negation and other logical principles. The chapter introduces and defines Cn-algebras as algebraic structures that capture the semantics of the Cn-Calculus, focusing especially on C1-algebras. These algebras generalize Boolean algebras by incorporating non-classical behavior for negation, resulting in structures where contradictory formulas can coexist without trivialization. The chapter explores the construction of Cn-algebras, their relationship to Curry systems, and the emergence of propositional Cn-algebras as a generalization of Rosenbloom’s propositional Boolean algebras. Representation theorems are established, connecting C1-algebras with Boolean and Heyting algebras. This work deepens the understanding of algebraic models for paraconsistent reasoning and supports their application in areas such as artificial intelligence, logic programming, and knowledge representation.