A logic in a finite language is said to be finitely presentable if it is axiomatized by finitely many finite rules. It is proved that binary non-indexed products of logics that are both finitely presentable and finitely equivalential are essentially finitely presentable. This result does not extend to binary non-indexed products of arbitrary finitely presentable logics, as shown by a counterexample. Finitely presentable logics are then exploited to introduce finitely presentable Leibniz classes, and to draw a parallel between the Leibniz (...) and the Maltsev hierarchies. (shrink)

A Leibniz class is a class of logics closed under the formation of term-equivalent logics, compatible expansions, and non-indexed products of sets of logics. We study the complete lattice of all Leibniz classes, called the Leibniz hierarchy. In particular, it is proved that the classes of truth-equational and assertional logics are meet-prime in the Leibniz hierarchy, while the classes of protoalgebraic and equivalential logics are meet-reducible. However, the last two classes are shown to be determined by Leibniz conditions consisting of (...) meet-prime logics only. (shrink)

The notion of an algebraizable logic in the sense of Blok and Pigozzi [3] is generalized to that of a possibly infinitely algebraizable, for short, p.i.-algebraizable logic by admitting infinite sets of equivalence formulas and defining equations. An example of the new class is given. Many ideas of this paper have been present in [3] and [4]. By a consequent matrix semantics approach the theory of algebraizable and p.i.-algebraizable logics is developed in a different way. It is related to the (...) theory of equivalential logics in the sense of Prucnal and Wroski [18], and it is extended to nonfinitary logics. The main result states that a logic is algebraizable (p.i.-algebraizable) iff it is finitely equivalential (equivalential) and the truth predicate in the reduced matrix models is equationally definable. (shrink)

In [14] we used the term finitely algebraizable for algebraizable logics in the sense of Blok and Pigozzi [2] and we introduced possibly infinitely algebraizable, for short, p.i.-algebraizable logics. In the present paper, we characterize the hierarchy of protoalgebraic, equivalential, finitely equivalential, p.i.-algebraizable, and finitely algebraizable logics by properties of the Leibniz operator. A Beth-style definability result yields that finitely equivalential and finitely algebraizable as well as equivalential and p.i.-algebraizable logics can be distinguished by injectivity of the Leibniz operator. Thus, (...) from a characterization of equivalential logics we obtain a new short proof of the main result of [2] that a finitary logic is finitely algebraizable iff the Leibniz operator is injective and preserves unions of directed systems. It is generalized to nonfinitary logics. We characterize equivalential and, by adding injectivity, p.i.-algebraizable logics. (shrink)

The paper is conceived as a first study on the Suszko operator. The purpose of this paper is to indicate the existence of close relations holding between the properties of the Suszko operator and the structural properties of the model class for various sentential logics. The emphasis is put on generality both of the results and methods of tackling the problems that arise in the theory of this operator. The attempt is made here to develop the theory for non-protoalgebraic logics.

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. (shrink)

The class of equivalential logics comprises all implicative logics in the sense of Rasiowa [9], Suszko's logic SCI and many others. Roughly speaking, a logic is equivalential iff the greatest strict congruences in its matrices are determined by polynomials. The present paper is the first part of the survey in which systematic investigations into this class of logics are undertaken. Using results given in [3] and general theorems from the theory of quasi-varieties of models [5] we give a characterization of (...) all simple C-matrices for any equivalential logic C. In corollaries we give necessary and sufficient conditions for the class of all simple models for a given equivalential logic to be closed under free products. (shrink)

There exist important deductive systems, such as the non-normal modal logics, that are not proper subjects of classical algebraic logic in the sense that their metatheory cannot be reduced to the equational metatheory of any particular class of algebras. Nevertheless, most of these systems are amenable to the methods of universal algebra when applied to the matrix models of the system. In the present paper we consider a wide class of deductive systems of this kind called protoalgebraic logics. These include (...) almost all (non-pathological) systems of prepositional logic that have occurred in the literature. The relationship between the metatheory of a protoalgebraic logic and its matrix models is studied. The following results are obtained for any finite matrix model U of a filter-distributive protoalgebraic logic : (I) The extension U of is finitely axiomatized (provided has only finitely many inference rules); (II) U has only finitely many extensions. (shrink)