For every logic \(\bL\), the notion of the Suszko congruence can be extended to its matrix models. The Suszko congruence of a matrix model \(\langle \bA, D \rangle\) of \(\bL\) (w.r.t. \(\bL)\) is the greatest congruence of \(\bA\) compatible with every \(\bL\)-filter of \(\bA\) that includes \(D\), that is, it is the relation given by \[{\bOmega^{\sim}_{\bA}}^{\bL}(D) = \bigcap_{D' \in \tFi_{\bL}(\bA)^D} \bOmega_{\bA}(D')\] where \(\tFi_{\bL}(\bA)^D = \{D': D'\) is a \(\bL\)-filter of \(\bA\) and \(D \subseteq D'\}\). Notice that unlike the intrinsic notion of Leibniz congruence, the Suszko congruence of a matrix model of \(\bL\) is not intrinsic to the matrix: it depends in an essential way on the logic under consideration. The theory of the Suszko congruence of matrices has been developed in Czelakowski 2003 and continued in Albuquerque &amp; Font &amp; Jansana 2016.