The complexity of a lattice polynomial is defined inductively, with variables having complexity 0. If p=plv'"vOk or p=plA'''/XOk is the canonical expression of the polynomial O, then the complexity c(p) = l+max{c(p~):l<-i-k}. An n-k lattice inclusion is an inclusion of the form p <-o-with c(p)<-n and c(o-)-k. In this note we use the main result of Day [1] to show that if all the congruence latt...

Let L be a finite distributive lattice, and let J(L) denote the set of all join-irreducible elements of L. Set j (L) = IJ(Z)l. For each a C J(L), let u(a) denote the number of elements in the prime filter {x C L: x >~a}. Our main theorem is Theorem 1. For any finite distributive lattice L, 4 "(a) ~>j(L)41q ,'2. aEJ(L) The base 4 here can most likely be replaced by a smaller number, but it canno...

We describe the normal subgroup lattice of the automorphism groups of the countable universal homogeneous distributive lattice and of the countable atomless generalized Boolean lattice. Also, we show that subgroups of these automorphism groups of index less than 2@0 lie between the pointwise and the setwise stabilizer of a nite set.

As a generalization of countably C-approximating posets, the concept of countably QC-approximating posets is introduced. With the countably QC-approximating property, some characterizations of generalized completely distributive lattices and generalized countably approximating posets are given. The main results are as follows: (1) a complete lattice is generalized completely distributive if and...

Let L be a lattice ordered effect algebra. We prove that the lattice uniformities on L which make uniformly continuous the operations ⊖ and ⊕ of L are uniquely determined by their system of neighbourhoods of 0 and form a distributive lattice. Moreover we prove that every such uniformity is generated by a family of weakly subadditive [0,+∞]-valued functions on L.

Let D be a finite distributive lattice with more than one element and let G be a finite group. We prove that there exists a modular (arguesian) lattice M such that the congruence lattice of M is isomorphic to D and the automorphism group of M is isomorphic to G.

In this paper we introduce the notion of generalized implication for lattices, as a binary function⇒ that maps every pair of elements of a lattice to an ideal. We prove that a bounded lattice A is distributive if and only if there exists a generalized implication ⇒ defined in A satisfying certain conditions, and we study the class of bounded distributive lattices A endowed with a generalized im...

We define the concept of weighted lattice polynomial functions as lattice polynomial functions constructed from both variables and parameters. We provide equivalent forms of these functions in an arbitrary bounded distributive lattice. We also show that these functions include the class of discrete Sugeno integrals and that they are characterized by a remarkable median based decomposition formula.

We investigate the lattice of machine invariant classes. This is an infinite completely distributive lattice but it is not a Boolean lattice. The length and width of it is c. We show the subword complexity and the growth function create machine invariant classes.