We examine the notion of primitive satisfaction in logical matrices. Theorem II. 1, being the matrix counterpart of Baker's well-known result for congruently distributive varieties of algebras (cf [1], Thm. 1.5), links the notions of primitive and standard satisfaction. As a corollary we give the matrix version of Jónsson's Lemma, proved earlier in [4]. Then we investigate propositional logics with disjunction. The main result, Theorem III. 2, states a necessary and sufficient condition for such logics to be finitely based.