Reduced products of logical matrices

Abstract

The class Matr(C) of all matrices for a prepositional logic (ℒ, C) is investigated. The paper contains general results with no special reference to particular logics. The main theorem (Th. (5.1)) which gives the algebraic characterization of the class Matr(C) states the following. Assume C to be the consequence operation on a prepositional language induced by a class K of matrices. Let m be a regular cardinal not less than the cardinality of C. Then Matr (C) is the least class of matrices containing K and closed under m-reduced products, submatrices, matrix homomorphisms, and matrix homomorphic counter-images.