Given a structure for a first-order language L, two objects of its domain can be indiscernible relative to the properties expressible in L, without using the equality symbol, and without actually being the same. It is this relation that interests us in this paper. It is called Leibniz equality. In the paper we study systematically the problem of its definibility mainly for classes of structures that are the models of some equality-free universal Horn class in an infinitary language Lκκ, where (...) κ is an infinite regular cardinal. (shrink)

The four-valued semantics of Belnap–Dunn logic, consisting of the truth values True, False, Neither, and Both, gives rise to several nonclassical logics depending on which feature of propositions we wish to preserve: truth, nonfalsity, or exact truth. Interpreting equality of truth values in this semantics as material equivalence of propositions, we can moreover see the equational consequence relation of this four-element algebra as a logic of material equivalence. In this paper, we axiomatize all combinations of these four-valued logics, for example, (...) the logic of truth and exact truth or the logic of truth and material equivalence. These combined systems are consequence relations which allow us to express implications involving more than one of these features of propositions. (shrink)

We study the lattice of extensions of four-valued Belnap–Dunn logic, called super-Belnap logics by analogy with superintuitionistic logics. We describe the global structure of this lattice by splitting it into several subintervals, and prove some new completeness theorems for super-Belnap logics. The crucial technical tool for this purpose will be the so-called antiaxiomatic (or explosive) part operator. The antiaxiomatic (or explosive) extensions of Belnap–Dunn logic turn out to be of particular interest owing to their connection to graph theory: the lattice (...) of finitary antiaxiomatic extensions of Belnap–Dunn logic is isomorphic to the lattice of upsets in the homomorphism order on finite graphs (with loops allowed). In particular, there is a continuum of finitary super-Belnap logics. Moreover, a non-finitary super-Belnap logic can be constructed with the help of this isomorphism. As algebraic corollaries we obtain the existence of a continuum of antivarieties of De Morgan algebras and the existence of a prevariety of De Morgan algebras which is not a quasivariety. (shrink)

The study of structure systems, an abstraction of the concept of first-order structures, is continued. Structure systems have algebraic systems as their algebraic reducts and their relational component consists of a collection of relation systems on the underlying functors. An analog of the expansion of a first-order structure by constants is presented. Furthermore, analogs of the Diagram Lemma and the Reduction Operator Lemma from the theory of equality-free first-order structures are provided in the framework of structure systems. (© 2007 WILEY-VCH (...) Verlag GmbH & Co. KGaA, Weinheim). (shrink)

We study logics determined by matrices consisting of a De Morgan lattice with an upward closed set of designated values, such as the logic of non‐falsity preservation in a given finite Boolean algebra and Shramko's logic of non‐falsity preservation in the four‐element subdirectly irreducible De Morgan lattice. The key tool in the study of these logics is the lattice‐theoretic notion of an n‐filter. We study the logics of all (complete, consistent, and classical) n‐filters on De Morgan lattices, which are non‐adjunctive (...) generalizations of the four‐valued logic of Belnap and Dunn (of the three‐valued logics of Priest and Kleene, and of classical logic). We then show how to find a finite Hilbert‐style axiomatization of any logic determined by a finite family of prime upsets of finite De Morgan lattices and a finite Gentzen‐style axiomatization of any logic determined by a finite family of filters on finite De Morgan lattices. As an application, we axiomatize Shramko's logic of anything but falsehood. (shrink)

In this paper we consider the structure of the class FGModS of full generalized models of a deductive system S from a universal-algebraic point of view, and the structure of the set of all the full generalized models of S on a fixed algebra A from the lattice-theoretical point of view; this set is represented by the lattice FACSs A of all algebraic closed-set systems C on A such that (A, C) ε FGModS. We relate some properties of these structures (...) with tipically logical properties of the sentential logic S. The main algebraic properties we consider are the closure of FGModS under substructures and under reduced products, and the property that for any A the lattice FACSs A is a complete sublattice of the lattice of all algebraic closed-set systems over A. The logical properties are the existence of a fully adequate Gentzen system for S, the Local Deduction Theorem and the Deduction Theorem for S. Some of the results are established for arbitrary deductive systems, while some are found to hold only for deductive systems in more restricted classes like the protoalgebraic or the weakly algebraizable ones. The paper ends with a section on examples and counterexamples. (shrink)

We provide a new proof of the following Pałasińska's theorem: Every finitely generated protoalgebraic relation distributive equality free quasivariety is finitely axiomatizable. The main tool we use are ${\mathcal{Q}}$ Q -relation formulas for a protoalgebraic equality free quasivariety ${\mathcal{Q}}$ Q . They are the counterparts of the congruence formulas used for describing the generation of congruences in algebras. Having this tool in hand, we prove a finite axiomatization theorem for ${\mathcal{Q}}$ Q when it has definable principal ${\mathcal{Q}}$ Q -subrelations. This (...) is a property obtained by carrying over the definability of principal subcongruences, invented by Baker and Wang for varieties, and which holds for finitely generated protoalgebraic relation distributive equality free quasivarieties. (shrink)

In this paper we address our efforts to extend the well-known connection in equational logic between equational theories and fully invariant congruences to other–possibly infinitary–logics. In the special case of algebras, this problem has been formerly treated by H. J. Hoehnke [10] and R. W. Quackenbush [14]. Here we show that the connection extends at least up to the universal fragment of logic. Namely, we establish that the concept of universal theory matches the abstract notion of fully invariant system. We (...) also prove that, inside this wide group of theories, the ones which are strict universal Horn correspond to fully invariant closure systems, whereas those which are universal atomic can be characterized as principal fully invariant systems. (shrink)

We present a finitary regularly algebraizable logic not finitely equivalential, for every similarity type. We associate to each of these logics a class of algebras with an equivalence relation, with the property that in this class, the identity is atomatically definable but not finitely atomatically definable.