Finite equational bases for finite algebras in a congruence-distributive equational class*

@article{Baker1977FiniteEB,
  title={Finite equational bases for finite algebras in a congruence-distributive equational class*},
  author={K. A. Baker},
  journal={Advances in Mathematics},
  year={1977},
  volume={24},
  pages={207-243}
}
  • K. A. Baker
  • Published 1977
  • Mathematics
  • Advances in Mathematics
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? Surprisingly, no ( R. C. Lyndon, 1954 ). The answer is, however, affirmative for various particular kinds of algebraic systems, such as finite groups (Oates and Powell), finite lattices, and even finite lattice-ordered algebraic systems (McKenzie). The purpose of the present paper is to provide a sufficient… Expand
A finite basis theorem for difference-term varieties with a finite residual bound
We prove that if V is a variety of algebras (i.e., an equationally axiomatizable class of algebraic structures) in a finite language, V has a difference term, and V has a finite residual bound, thenExpand
Para primal varieties: A study of finite axiomatizability and definable principal congruences in locally finite varieties
We introduce new sufficient conditions for a finite algebraU to possess a finite basis of identities. The conditions are that the variety generated byU possess essentially only finitely manyExpand
Approximate distributive laws and finite equational bases for finite algebras in congruence-distributive varieties
Abstract.For a congruence-distributive variety, Maltsev’s construction of principal congruence relations is shown to lead to approximate distributive laws in the lattice of equivalence relations onExpand
Finite equational bases for congruence modular varieties
In this paper it is proved that a variety generated by a finite algebraic system with finitely many operations is finitely axiomatizable, provided that the variety is congruence modular andExpand
Non-Finite-Axiomatizability Results in Algebraic Logic
TLDR
The present paper gives a negative answer to the problem of B. Jonsson whether relation set algebras can be expanded by finitely many new operations in a “reasonable” way so that the class of these expansions would possess a finite equational base. Expand
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
THE FINITE BASIS PROBLEM
A finite algebra of finite type (i.e., having just finitely many fundamental operations) is finitely based if the variety it generates can be axiomatized by just finitely many equations. The finiteExpand
Nilpotent and solvable radicals in locally finite congruence modular varieties
The Loewy rank of a modular latticeL of finite height is defined as the leastn for which there exista0=0<at, < ... <ar=1 inL such that each interval I[ai, ai+1] is a complemented lattice. In thisExpand
Niipotent and solvable radicals in locally finite congruence modular varieties
The Loewy rank of a modular lattice L of finite height is defined as the least n for which there exist % = 0 < at < �9 �9 - < a~ = 1 in L such that each interval llai, a, ~ ~) is a complementedExpand
Equational theories with a minority polynomial
It is known that every finitely based variety of algebras with distributive and permutable congruences is one-based and those admitting a majority poly- nomial are two-based. In this note we proveExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 61 REFERENCES
Bases for equational theories of semigroups
Finite algebraic structure, cvcn those with a single binary operation and only a few elements, can present questions which are surprisingly difficult to answer. R. Lyndon in [4] asked “Does everyExpand
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
Equational theories of algebras with distributive congruences
If an equational class of algebras has the distributive or permutable congruence property then it is well known that it satisfies certain conditions, known as Mal'cev-type conditions. In this noteExpand
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
Distributivity and permutability of congruence relations in equational classes of algebras
1. Preliminary concepts. In slightly different terminology and notation, all of the concepts and results discussed in this section (except Theorem 1) are to be found in the work of Birkhoff [2; 3].Expand
Equational bases and nonmodular lattice varieties
This paper is focused on equational theories and equationally defined varieties of lattices which are not assumed to be modular. It contains both an elementary introduction to the subject and aExpand
Equational axioms for classes of lattices
1. Equational axiom problems. This note presents a general method for solving a number of problems in the equational theory of lattices. Current interest in this theory stems from Jonsson's importantExpand
Equational Logic and Equational Theories of Algebras
Publisher Summary This chapter discusses several metalogical notions referring to equational theories of algebras and, more generally, to equational logic. It also presents a short survey of theExpand
Translations and congruences in lattices
As far as recent litterature is concerned, the study of congruences on a nondistributive lattice L seems to require either distributivity conditions (as in [4]) or the consideration of translations,Expand
Identities and relations in commutative Moufang loops
We combine techniques used by Lyndon [4] in showing that the identities of a nilpotent group are finitely based with some related ideas of Higman [3] and the results of Bruck [I] on the structure ofExpand
...
1
2
3
4
5
...