 Thus, \(a \le_{\cA } b\) if and only if \(b\) belongs to every \(C\)-closed set to which \(A\) belongs. For a fully selfextensional logic \(\bL\), this quasi-order turns into a partial order in the reduced full g-models, which are in fact the reduced basic full g-models, namely, the abstract logics \(\langle \bA, \tFi_{\bL }\bA \rangle\) with \(\bA \in \bAlg\bL\). Consequently, in a fully selfextensional logic \(\bL\) every algebra \(\bA \in \bAlg\bL\) carries a partial order definable in terms of the family of the \(\bL\)-filters. If the logic is fully selfextensional with a conjunction this partial order is definable by an equation of the \(L\)-algebraic language because in this case for every algebra \(\bA \in \bAlg\bL\) we have: \[a \le b\txtiff C(b) \subseteq C(a)\txtiff C(a \wedge^{\bA } b) = C(a)\txtiff a \wedge^{\bA } b = a,\] where \(C\) is the abstract consequence operation that corresponds to the closed-set system \(\tFi_{\bL }\bA\), and \(\wedge^{\bA}\) is the operation defined on \(\bA\) by the formula that is a conjunction for the logic \(\bL\).