 In C. Sernadas et al. 2002b other examples of collapse were presented, and a solution to the problem was proposed by means of a controlled notion of algebraic fibring called modulated fibring. An apparently simpler solution to the collapsing problem appeared in Caleiro and Ramos 2007, using a variant of the algebraic fibring technique called cryptofibring. As mentioned in  subsection 4.6,  the graph-theoretic fibring leads to an additional solution to this problem. Another solution to the collapsing problem was obtained by means of the meet combination of logics (see  subsection 4.6).  Given that the combined connectives inherit the common properties enjoyed in both logics, the interaction between the component logics within the resulting logic is minimized, which allows to overcome the collapsing problem.