Abstract
The constructions of sequential calculi are based on the idea of application to the deduction process not only single logical constants but complexes of them as well. Surely, making use of this idea is not obligatory in paraconsistent logic. Nevertheless, using it in this field gives us a convenient tool for seeking proofs in formulation of many paraconsistent logics. Each of sequential propositional logics discussed in this paper is obtained as a result of a transformation of a starting calculus GCL – one of sequential formalizations of classical propositional logic. Let α be a standard propositional language with a vocabulary {p1, p2, p3, . . . , −,∨, &, ⊃,¬,), we shall denote any formulas of α and by the letters Γ,∆, Σ, Θ finite sets of α-formulas