Finite basis theorems for relatively congruence-distributive quasivarieties

  title={Finite basis theorems for relatively congruence-distributive quasivarieties},
  author={D. Pigozzi},
  journal={Transactions of the American Mathematical Society},
  • D. Pigozzi
  • Published 1988
  • Mathematics
  • Transactions of the American Mathematical Society
Q is any quasivariety. A congruence relation 0 on a mem- ber A of Q is a Q-congruence if A/0 G Q. The set CouqA. of all Q- congruences is closed under arbitrary intersection and hence forms a complete lattice Cong A. Q. is relatively congruence-distributive if ConjA is distribu- tive for every A e Q.. Relatively congruence-distributive quasivarieties occur naturally in the theory of abstract data types. Q is finitely generated if it is generated by a finite set of finite algebras. The following… Expand
Quasi-Identities of Congruence-Distributive Quasivarieties of Algebras
LetR be an arbitrary quasivariety of algebras and A an algebra not necessarily inR. A congruence θ ∈ ConA is an R-congruence if A/θ ∈ R. The set ConRA of all R-congruences of A makes an algebraicExpand
Finite bases for finitely generated, relatively congruence distributive quasivarieties
In [21], D. Pigozzi has proved in a non-constructive way that every relatively congruence distributive quasivariety of finite type generated by a finite set of finite algebras is finitelyExpand
Relative congruence formulas and decompositions in quasivarieties
Quasivarietal analogues of uniform congruence schemes are discussed, and their relationship with the equational definability of principal relative congruences (EDPRC) is established, along with theirExpand
The weak extension property and finite axiomatizability for quasivarieties
We define and compare a selection of congruence properties of quasivarieties, including the relative congruence meet semi-distributivity, RSD(∧), and the weak extension property, WEP. We prove thatExpand
Relation Formulas for Protoalgebraic Equality Free Quasivarieties; Pałasińska’s Theorem Revisited
A finite axiomatization theorem is proved for Q when it has definable principal Q-subrelations and it holds for finitely generated protoalgebraic relation distributive equality free quasivarieties. Expand
Least V-quasivarieties of MV-algebras
  • J. Gispert
  • Mathematics, Computer Science
  • Fuzzy Sets Syst.
  • 2016
It turns out that every variety has a least V-quasivariety denoted by Q V, and a Komori's type characterization of Q V is obtained for every proper subvariety of MV-algebras. Expand
The Equationally-Defined Commutator in Quasivarieties Generated by Two-Element Algebras
The notion of the equationally-defined commutator was introduced and thoroughly investigated in (Czelakowski, 2015). In this work the properties of the equationally-defined commutator inExpand
Quasivarieties with Definable Relative Principal Subcongruences
It is proved that a quasivariety of algebras with definable relative principal subcongruences has a finite quasiequational basis if and only if the class of its relative (finitely) subdirectly irreducible algeBRas is strictly elementary. Expand
Triangular irreducibility of congruences in quasivarieties
Certain forms of irreducibility as well as of equational definability of relative congruences in quasivarieties are investigated. For any integer $${m \geqslant 3}$$m⩾3 and a quasivariety Q, theExpand
Inconsistency lemmas in algebraic logic
  • J. Raftery
  • Mathematics, Computer Science
  • Math. Log. Q.
  • 2013
It is proved that, when a (finitary) deductive system is algebraized by a variety, then has an inconsistency lemma—in the abstract sense—iff every algebra in has a dually pseudo-complemented join semilattice of compact congruences. Expand


Finite equational bases for finite algebras in a congruence-distributive equational class*
Abstract Does every finite algebraic system A with finitely many operations possess a finite list of polynomial identities (laws), valid in A , from which all other such identities follow?Expand
A finite basis theorem for quasivarieties
We consider varieties with the property that the intersection of any pair of principal congruences is finitely generated, and, in fact, generated by pairs of terms constructed from the generators ofExpand
Subdirect unions in universal algebra
The number of distinct operations (that is, the range of the variable a) may be infinite, but for our main result (Theorem 2), we shall require every n(a) to be finite—that is, it will concernExpand
Algebraic Semantics for Quasi-Classical Modal Logics
The algebraic approach made available some general results from Universal Algebra, notably those obtained by Jonsson, and thereby was able to contribute new insights in the realm of normal modal logics, but to quasi-classical modallogics in general is generalized. Expand
Primitive satisfaction and equational problems for lattices and other algebras
This paper presents a general method of solving equational problems in all equational classes of algebras whose congruence lattices are distributive, such as those consisting of lattices, relationExpand
Concerning axiomatizability of the quasivariety generated by a finite Heyting or topological Boolean algebra
In classes of algebras such as lattices, groups, and rings, there are finite algebras which individually generate quasivarieties which are not finitely axiomatizable (see [2], [3], [8]). We show hereExpand
Matrices, primitive satisfaction and finitely based logics
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 (cfExpand
Equational Logic as a Programming Language
This book provides a comprehensive description of the theoretical foundations, design, and implementation of an innovative logic programming language in which computations are produced directly from equational definitions, providing powerful programming techniques not available in conventional languages. Expand
Data Type Specification: Parameterization and the Power of Specification Techniques
The "hidden function" problem is investigated, it is proved that condit ional specifications are inherently more powerful than equational specifications, and it is shown that parameterized specifications must contain "side conditions". Expand
Equational Logic Programming
The invention relates to a method of irradiating animals for reseach purposes utilizing this cage by embedding a planar array of irradiation sources in spaced-apart relationship in the plate serving as the irradiator. Expand