In this paper we define and study a generalized notion of a logical system that covers on an equal formal basis sentential, equational and sequential systems. We develop a general theory of equivalence between generalized logics that provides, first, a conception of algebraizable logic , second, a formal concept of equivalence between sequential systems and, third, a notion of equivalence between sentential and sequential systems. We also use our theory of equivalence for developing a general algebraic approach to conjunctive non-pseudo-axiomatic (...) self-extensional sentential logics. Finally, we consider within the framework of the mentioned approach various sequential formulations for some well-known sentential logics. (shrink)

As it was proved in [4, Sect. 3], the poset of extensions of the propositional logic defined by a class of logical matrices with equationally-definable set of distinguished values is a retract, under a Galois connection, of the poset of subprevarieties of the prevariety generated by the class of the underlying algebras of the defining matrices. In the present paper we apply this general result to the three-valued paraconsistent logic proposed by Hałkowska–Zajac [2]. Studying corresponding prevarieties, we prove that extensions (...) of the logic involved form a four-element chain, the only proper consistent extensions being the least non-paraconsistent extension of it and the classical logic. RID=""ID="" Mathematics Subject Classification (2000): 03B50, 03B53, 03G10 RID=""ID="" Key words or phrases: Many-valued logic – Paraconsistent logic – Extension – Prevariety – Distributive lattice. (shrink)

In this paper we study 12 four-valued logics arisen from Belnap's truth and/or knowledge four-valued lattices, with or without constants, by adding one or both or none of two new non-regular operations—classical negation and natural implication. We prove that the secondary connectives of the bilattice four-valued logic with bilattice constants are exactly the regular four-valued operations. Moreover, we prove that its expansion by any non-regular connective (such as, e.g., classical negation or natural implication) is strictly functionally complete. Further, finding axiomatizations (...) of the quasi varieties generated by the 12 logics involved (that prove to be varieties), we find naturell equational axiomatizations of these logics. Finally, applying Pynko's general theory of algebraizable sequential consequence operations, we also find equivalent natural sequentiell axiomatizations of the logics under consideration that expand either of two Pynko's sequential calculi for the constant-free truth-lattice four-valued logic. (shrink)

In this paper we deal with infinitary universal Horn logic both with and without equality. First, we obtain a relative Lyndon-style interpolation theorem. Using this result, we prove a non-standard preservation theorem which contains, as a particular case, a Lyndon-style theorem on surjective homomorphisms in its Makkai-style formulation. Another consequence of the preservation theorem is a theorem on bimorphisms, which, in particular, provides a tool for immediate obtaining characterizations of infinitary universal Horn classes without equality from those with equality. From (...) the theorem on surjective homomorphisms we also derive a non-standard Beth-style preservation theorem that yields a non-standard Beth-style definability theorem, according to which implicit definability of a relation symbol in an infinitary universal Horn theory implies its explicit definability by a conjunction of atomic formulas. We also apply our theorem on surjective homomorphisms, theorem on bimorphisms and definability theorem to algebraic logic for general propositional logic. (shrink)