Note on the distributive closure operators of a complete lattice
Morgado, José (1964)
Portugaliae mathematica
Similarity:
Morgado, José (1964)
Portugaliae mathematica
Similarity:
André Sesboüé (1996)
Czechoslovak Mathematical Journal
Similarity:
Marcin Łazarz (2019)
Bulletin of the Section of Logic
Similarity:
Even if a lattice L is not distributive, it is still possible that for particular elements x, y, z ∈ L it holds (x∨y) ∧z = (x∧z) ∨ (y ∧z). If this is the case, we say that the triple (x, y, z) is distributive. In this note we provide some sufficient conditions for the distributivity of a given triple.
J. Płonka (1968)
Fundamenta Mathematicae
Similarity:
Kiyomitsu Horiuchi, Andreja Tepavčević (2001)
Discussiones Mathematicae - General Algebra and Applications
Similarity:
A triple-semilattice is an algebra with three binary operations, which is a semilattice in respect of each of them. A trice is a triple-semilattice, satisfying so called roundabout absorption laws. In this paper we investigate distributive trices. We prove that the only subdirectly irreducible distributive trices are the trivial one and a two element one. We also discuss finitely generated free distributive trices and prove that a free distributive trice with two generators has 18 elements. ...
Vinayak V. Joshi, B. N. Waphare (2005)
Mathematica Bohemica
Similarity:
The concept of a 0-distributive poset is introduced. It is shown that a section semicomplemented poset is distributive if and only if it is 0-distributive. It is also proved that every pseudocomplemented poset is 0-distributive. Further, 0-distributive posets are characterized in terms of their ideal lattices.
Wiesław Dziobiak (1989)
Fundamenta Mathematicae
Similarity:
Joanna Grygiel (2004)
Discussiones Mathematicae - General Algebra and Applications
Similarity:
We present a construction of finite distributive lattices with a given skeleton. In the case of an H-irreducible skeleton K the construction provides all finite distributive lattices based on K, in particular the minimal one.