On the modularity of the lattice of fundamental orders on a semilattice.
S.M. Goberstein (1982)
Semigroup forum
Similarity:
S.M. Goberstein (1982)
Semigroup forum
Similarity:
Shriram Nimbhorkar, Anwari Rahemani (2011)
Open Mathematics
Similarity:
Characterizations for a pseudocomplemented modular join-semilattice with 0 and 1 and its ideal lattice to be a Stone lattice are given.
Sándor Radeleczki (2002)
Discussiones Mathematicae - General Algebra and Applications
Similarity:
We define and study classification systems in an arbitrary CJ-generated complete lattice L. Introducing a partial order among the classification systems of L, we obtain a complete lattice denoted by Cls(L). By using the elements of the classification systems, another lattice is also constructed: the box lattice B(L) of L. We show that B(L) is an atomistic complete lattice, moreover Cls(L)=Cls(B(L)). If B(L) is a pseudocomplemented lattice, then every classification system of L is independent...
K. Adaricheva, Wiesław Dziobiak, V. Gorbunov (1993)
Fundamenta Mathematicae
Similarity:
We prove that a finite atomistic lattice can be represented as a lattice of quasivarieties if and only if it is isomorphic to the lattice of all subsemilattices of a finite semilattice. This settles a conjecture that appeared in the context of [11].
Jaroslav Ježek (1981)
Czechoslovak Mathematical Journal
Similarity:
Cohn, Henry, Kumar, Abhinav (2004)
Electronic Research Announcements of the American Mathematical Society [electronic only]
Similarity:
Yuichi Futa, Yasunari Shidama (2017)
Formalized Mathematics
Similarity:
In this article, we formalize in Mizar [5] the definition of dual lattice and their properties. We formally prove that a set of all dual vectors in a rational lattice has the construction of a lattice. We show that a dual basis can be calculated by elements of an inverse of the Gram Matrix. We also formalize a summation of inner products and their properties. Lattice of ℤ-module is necessary for lattice problems, LLL(Lenstra, Lenstra and Lovász) base reduction algorithm and cryptographic...
Emel Aşıcı, Funda Karaçal (2016)
Kybernetika
Similarity:
In this paper, we define the set of incomparable elements with respect to the triangular order for any t-norm on a bounded lattice. By means of the triangular order, an equivalence relation on the class of t-norms on a bounded lattice is defined and this equivalence is deeply investigated. Finally, we discuss some properties of this equivalence.
Kołodziejczyk, Krzysztof (1999)
Beiträge zur Algebra und Geometrie
Similarity:
P. V. Ramana Murty, Teresa Engelbert (1985)
Mathématiques et Sciences Humaines
Similarity: