The approaches taken for motivating the systems of paraconsistent logic which we have so far seen isolate inconsistency from consistent parts of the given theory. The aim is to retain as much classical machinery as possible in developing a system of paraconsistent logic which, nonetheless, avoids explosion when faced with a contradiction. One way to make this aim explicit is to extend the expressive power of our language by encoding the metatheoretical notions of consistency (and inconsistency) in the object language. The Logics of Formal Inconsistency (LFIs) are a family of paraconsistent logics that constitute consistent fragments of classical logic yet which reject explosion principle where a contradiction is present. The investigation of this family of logics was initiated by Newton da Costa in Brazil.
An effect of encoding consistency (and inconsistency) in the object language is that we can explicitly separate inconsistency from triviality. With a language rich enough to express inconsistency (and consistency), we can study inconsistent theories without assuming that they are necessarily trivial. This makes it explicit that the presence of a contradiction is a separate issue from the non-trivial nature of paraconsistent inferences.
The thought behind LFIs is that we should respect classical logic as much as possible. It is only when there is a contradiction that logic should deviate from it. This means that we can admit the validity of ECQ in the absence of contradictions. In order to do so, we encode ‘consistency’ into our object language by O. Then ⊢ is a consequence relation of an LFI iff
∃Γ∃A∃B(Γ, A, ¬A ⊬ B) and
∀Γ∀A∀B(Γ, OA, A, ¬A ⊢ B).
Let ⊢C be the classical consequence (or derivability) relation and O(Γ

express the consistency of the set of formulas Γ such that if OA and OB then O(A * B) where * is any two place logical connective. Then we can capture derivability in the consistent context in terms of the equivalence: ∀Γ∀B∃Δ(Γ ⊢C B iff O(Δ

, Γ ⊢ B).
Now take the positive fragment of classical logic with modus ponens plus double negation elimination (¬¬A → A) as an axiom and some axioms governing O:
A → (A → (¬A → B))
(A ∧ B) → (A ∧ B)
(A ∧ B) → (A → B)
Then ⊢ provides da Costa’s system C1. If we let A1 abbreviate the formula ¬(A ∧ ¬A) and An+1 the formula (¬(An ∧ ¬An))1, then we obtain Ci for each natural number i greater than 1.
To obtain da Costa’s system Cω, instead of the positive fragment of classical logic, we start with positive intuitionist logic instead. Ci systems for finite i do not rule out (An ∧ ¬An ∧ An+1) from holding in a theory. By going up the hierarchy to ω, Cω rules out this possibility. Note, however, that Cω is not a LFC as it does not contain classical positive logic. [Graham Priest & Koji Tanaka, "Paraconsistent Logic," sec. 5.5]