 To be more precise, a (finite) set of formulas, \(\Sigma\), can be partitioned into classically consistent fragments whose union is \(\Sigma\). Let \(\vdash\) be the classical consequence relation. A covering of \(\Sigma\) is a set \(\{\Sigma_i : i \in I\}\), where each member is consistent, and \(\Sigma = \bigcup_{i \in I} \Sigma_i\). The level of \(\Sigma , l(\Sigma)\), is the least \(n\) such that \(\Sigma\) can be partitioned into \(n\) sets if there is such \(n\), or \(\infty\) if there is no such \(n\). A consequence relation, called forcing, \(\Vdash\), is defined as follows. \(\Sigma\Vdash A\) iff \(l(\Sigma) = \infty\), or \(l(\Sigma) = n\) and for every covering of size \(n\) there is a \(j \in I\) such that \(\Sigma_j \vdash A\). If \(l(\Sigma) = 1\) or \(\infty\) then the forcing relation coincides with classical consequence relation. In case where \(l(\Sigma) = \infty\), there must be a sentence of the form \(A \wedge \neg A\) and so the forcing relation explodes.