Results 31 to 40 of about 743,469 (374)

Characterization of Almost Semi-Heyting Algebra

Discussiones 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., Ratnamani M.V., Ramesh S.   +2 more
doaj   +1 more source

Evolution on distributive lattices [PDF]

Journal of Theoretical Biology, 2006
22 pages, 4 figures; minor corrections, moved details to appendix.
Beerenwinkel, Niko, Eriksson, Nicholas, Sturmfels, Bernd   +2 more
openaire   +4 more sources

Sahlqvist via Translation [PDF]

Logical 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, Alessandra Palmigiano, Zhiguang Zhao   +2 more
doaj   +1 more source

μ-Fuzzy Filters in Distributive Lattices

Advances 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

f-Fixed Points of Isotone f-Derivations on a Lattice

Discussiones Mathematicae - General Algebra and Applications, 2019
In a recent paper, Çeven and Öztürk have generalized the notion of derivation on a lattice to f-derivation, where f is a given function of that lattice into itself.
Zedam Lemnaouar, Yettou Mourad, Amroune Abdelaziz   +2 more
doaj   +1 more source

The annihilator graph of a 0-distributive lattice [PDF]

Transactions on Combinatorics, 2018
‎‎In this article‎, ‎for a lattice $\mathcal L$‎, ‎we define and investigate‎ ‎the annihilator graph $\mathfrak {ag} (\mathcal L)$ of $\mathcal L$ which contains the zero-divisor graph of $\mathcal L$ as a subgraph‎. ‎Also‎, ‎for a 0-distributive lattice
Saeid Bagheri, Mahtab Koohi Kerahroodi
doaj   +1 more source

Characterizing fully principal congruence representable distributive lattices [PDF]

, 2017
Motivated by a recent paper of G. Gr\"atzer, a finite distributive lattice $D$ is said to be fully principal congruence representable if for every subset $Q$ of $D$ containing $0$, $1$, and the set $J(D)$ of nonzero join-irreducible elements of $D ...
A Urquhart, G Czédli, G Czédli, G Czédli, G Czédli, G Czédli, G Czédli, G Czédli, G Grätzer, G Grätzer, G Grätzer, G Grätzer, G Grätzer, G Grätzer, G Grätzer, G Grätzer, Gábor Czédli, R Freese   +17 more
core   +2 more sources

Distributive and Dual Distributive Elements in Hyperlattices

Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2017
In this paper we introduce and study distributive elements, dual distributive elements in hyperlattices, and prove that these elements forms ∧-semi lattice and ∨-semi hyperlattice, respectively.
Ameri Reza, Amiri-Bideshki M., Hoskova-Mayerova Sarka, Saeid A. B.   +3 more
doaj   +1 more source

Congruences of finite semidistributive lattices

Cubo
We show that there are finite distributive lattices that are not the congruence lattice of any finite semidistributive lattice. For \(0 \leq k \leq 2\), the distributive lattice \((\mathbf{B}_k)_{++} = \mathbf{2} + \mathbf{B}_k\), where \(\mathbf{B}_k ...
J. B. Nation
doaj   +1 more source

Notes on the description of join-distributive lattices by permutations [PDF]

, 2012
Let L be a join-distributive lattice with length n and width(Ji L) \leq k. There are two ways to describe L by k-1 permutations acting on an n-element set: a combinatorial way given by P.H. Edelman and R.E.
Adaricheva, Kira, Czédli, Gábor
core   +3 more sources