Results 21 to 30 of about 769 (267)

On Decompositions of Matrices over Distributive Lattices

open access: yesJournal of Applied Mathematics, 2014
Let L be a distributive lattice and Mn,q (L)(Mn(L), resp.) the semigroup (semiring, resp.) of n × q (n × n, resp.) matrices over L. In this paper, we show that if there is a subdirect embedding from distributive lattice L to the direct product ∏i=1m‍Li ...
Yizhi Chen, Xianzhong Zhao
doaj   +1 more source

A note on operations of hesitant fuzzy sets [PDF]

open access: yesInternational Journal of Computational Intelligence Systems, 2015
In this paper, properties of operations and algebraic structures of hesitant fuzzy sets are investigated. Semilattices of hesitant fuzzy sets with union and intersection are discussed, respectively.
Zheng Pei, Liangzhong Yi
doaj   +1 more source

K-FILTERS OF DISTRIBUTIVE LATTICES [PDF]

open access: yesJournal of Algebraic Systems
The concept of K-filters is introduced in distributive lattices and studied some properties of these classes of filters. Some necessary and sufficient conditions are derived for every π-filter of a distributive lattice to become a K-filter.
Mukkamala Sambasiva Rao
doaj   +1 more source

The rank of a distributive lattice

open access: yesDiscrete Mathematics, 1979
AbstractThe rank of a partial ordering P is the maximum size of an irredundant family of linear extensions of P whose intersection is P. A simple relationship is established between the rank of a finite distributive lattice and its subset of join irreducible elements.
I. Rabinovitch, I. Rival
openaire   +2 more sources

Distributive Lattice Polyhedra

open access: yesElectronic Notes in Discrete Mathematics, 2009
Abstract Poly-antimatroids are generalization of the notion of antimatroid to multisets. When the underlying set consists of only two elements, such two-dimensional poly-antimatroids correspond to point sets in the integer lattice Z d . In this research we concentrate on geometrical properties of two-dimensional poly-antimatroids and prove ...
Yulia Kempner, Vadim E. Levit
openaire   +1 more source

Non-deterministic-M-fuzzy Lattices

open access: yesRatio Mathematica, 2023
Goran Trajakoviski and Tepavcevic´invented the L-fuzzy lattice  in which a ´ bounded lattice is fuzzified using a complete lattice. Using a complete consistent distributive multilattice M, we broaden the concept of L-fuzzy lattice to Nd-M-fuzzy lattice ...
Gireesan K.K.   +2 more
doaj   +1 more source

Characterization of Almost Semi-Heyting Algebra

open access: yesDiscussiones Mathematicae - General Algebra and Applications, 2020
In this paper, we initiate the discourse on the properties that hold in an almost semi-Heyting algebra but not in an semi-Heyting almost distributive lattice.
Srikanth V.V.V.S.S.P.S.   +2 more
doaj   +1 more source

μ-Fuzzy Filters in Distributive Lattices

open access: yesAdvances in Fuzzy Systems, 2020
In this paper, we introduce the concept of μ-fuzzy filters in distributive lattices. We study the special class of fuzzy filters called μ-fuzzy filters, which is isomorphic to the set of all fuzzy ideals of the lattice of coannihilators.
Wondwosen Zemene Norahun
doaj   +1 more source

“Complete-simple” distributive lattices [PDF]

open access: yesProceedings of the American Mathematical Society, 1993
It is well known that the only simple distributive lattice is the two-element chain. We can generalize the concept of a simple lattice to complete lattices as follows: a complete lattice is complete-simple if it has only the two trivial complete congruences.
Grätzer, G., Schmidt, E. T.
openaire   +1 more source

Sahlqvist via Translation [PDF]

open access: yesLogical Methods in Computer Science, 2019
In recent years, unified correspondence has been developed as a generalized Sahlqvist theory which applies uniformly to all signatures of normal and regular (distributive) lattice expansions.
Willem Conradie   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy