This book addresses Birkhoff and Mal’cev’s problem of describing subquasivariety lattices. The text begins by developing the basics of atomic theories and implicational theories in languages that may, or may not, contain equality. Subquasivariety lattices are represented as lattices of closed algebraic subsets of a lattice with operators, which yields new restrictions on the equaclosure operator. As an application of this new approach, it is shown that completely distributive lattices with a dually compact least element are subquasivariety lattices. The book contains many examples to illustrate these principles, as well as open problems. Ultimately this new approach gives readers a set of tools to investigate classes of lattices that can be represented as subquasivariety lattices.
Table of Content
Preface.- Introduction.- Varieties and quasivarieties in general languages.- Equaclosure operators.- Preclops on finite lattices.- Finite lattices as Sub(S, ∧, 1, ����): The case J(L) ⊆ ���� (L).- Finite lattices as Sub(S, ∧, 1, ����): The case J(L) ̸⊆ ���� (L).- The six-step program: From (L, ����) to (Lq(����), Γ).- Lattices 1 + L as Lq(����).- Representing distributive dually algebraic lattices.- Problems and an advertisement.- Appendices.
More ebooks from the same author(s) / Editor
1,248 Ebooks in this category
