 Representation Theorem for Preferential Logics: if \(\dproves\) is a cumulative, supraclassical, strongly absorptive, and distributive consequence relation (i.e., a preferential relation) then there is a preferential structure \(\mathcal{M}\) satisfying the Limit Assumption such that for all finite theories \(T\), the set of \(\dproves\) -consequences of \(T\) is exactly the set of formulas true in every preferred model of \(T\)  in M.[3]