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.

A lattice L is uniform, if for any congruence Θ of L, any two congruence classes A and B of Θ are of the same size, that is, |A| = |B| holds. A classical result of R. P. Dilworth represents a finite distributive lattice D as the congruence lattice of a finite lattice L. We show that this L can be constructed as a finite uniform lattice.

If L is a finite lattice, we show that there is a natural topological lattice structure on the geometric realization of its order complex ∆(L) (definition recalled below). Lattice-theoretically, the resulting object is a subdirect product of copies of L. We note properties of this construction and of some variants, and pose several questions. For M3 the 5-element nondistributive modular lattice...

and Applied Analysis 3 such that a ∈⇓ d. Thus d ∈⇑ a ⊆ U. Therefore D ∩ U ̸ = 0, hence U ∈ σ(P). This proves τ(P) ⊆ σ(P). (2) Now assume that P is strongly continuous. Then P is continuous. In a strongly continuous lattice, the relation ≪ and ⇐ are the same by the Theorem 2.5 of [5]. Also by [2] in a continuous lattice, every Scott open set A satisfies the condition A = ↑≪A, it follows that ever...