𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Equations in the theory of Q-distributive lattices

✍ Scribed by Alejandro Petrovich


Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
459 KB
Volume
175
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis


A Q-distributive lattice is an algebra (L, v, A, V, 0, 1 ) of type (2, 2, 1, 0, 0) such that (L, V, A, 0, 1 ) is a bounded distributive lattice and 27 satisfies the equations V0 = 0, x A Vx = x, V(x V y) = Vx V Vy and V(x A Vy) = Vx A 27y. The aim of this paper is to find, for each proper subvariety of the variety of Q-distributive lattices, an equation which determines it, relatively to the whole variety, as well as to give a characterization of the minimum number of variables needed in such equation.

A quantifier on a bounded distributive lattice L is a unary operation V on L that satisfies V0 = 0, x A Vx = x, V(x V y) = Vx V Vy and V(x A Vy) =-Vx A Vy. A quantifier V is called simple if and only if it is given by the prescription: V0 --0 and Va= 1 for eachaΒ’0.

A Q-distributive lattice is an algebra (L, V, A, V, 0, 1) of type (2, 2, 1, 0, 0) such that (L, V, A, 0, 1 ) is a bounded distributive lattice and V is a quantifier on L. The variety of Q-distributive lattices will be denoted by 2.

Q-distributive lattices were introduced by Cignoli in [2] and he showed that the lattice of equational subclasses of ~ is a chain of type (o + 1.

In this paper we first find, for each proper subvariety of ~, an equation which determines it. Secondly, we give a characterization of the minimum number of variables needed in an equation characterizing a given subvariety, and we determine this number in some cases.

We begin with some notation. We shall denote by 2 the Boolean algebra with two elements. For each natural number p, Bp will denote the Boolean algebra 2 p endowed with the simple quantifier, and Cp the lattice 2 p with a new 1 added endowed with the simple quantifier, provided p~> 1, and Co = B0. For each (p, q) E w x w, Opq will denote the subjacent lattice Bp x Cq endowed with the simple quantifier. (Observe, in


πŸ“œ SIMILAR VOLUMES


On the Homology of Distributive Lattices
✍ W.F. Doran IV πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 167 KB

This paper gives a method for computing the reduced poset homology of the rank-selected subposet of a distributive lattice. As an example of the method, let L be the lattice S b acts on L by permuting coordinates. For S βŠ† [ab], we give a description of the decomposition of the reduced homology of L

The skeletons of free distributive latti
✍ Rudolf Wille πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 707 KB

The skeletons of free distributive lattices are studied by methods of formal concept analysis; in particular, a specific closure system of sublattices is elaborated to clarify the structure of the skeletons. Up to five generators, the skeletons are completely described.

Stratification structures on a kind of c
✍ Hongbin Cui; Chongyou Zheng πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 398 KB

In this paper, we shall introduce the concept of stratification structures on completely distributive lattices by direct product decompositions of completely distributive lattices, and prove that there is, up to isomorphism, a unique stratification structure on any normal completely distributive lat

On the widths of finite distributive lat
✍ Jeff Kahn; Michael Saks πŸ“‚ Article πŸ“… 1987 πŸ› Elsevier Science 🌐 English βš– 707 KB

The following conjecture of U Faigle and B Sands is proved: For every number R > 0 there exists a number n(R) such that if 2 is a finite distributive lattice whose width w(Z) (size of the largest antichain) is at least n(R), then IZ/a Rw(Z). In words this says that as one considers ~ increasingly la