Results 191 to 198 of about 342 (198)
Some of the next articles are maybe not open access.
All retraction operators on a complete lattice form a complete lattice
Acta Mathematica Sinica, 1991Summary: \textit{H. Crapo} [J. Pure Appl. Algebra 23, 13-28 (1982; Zbl 0474.06004)] raised the following problem: If P is a complete lattice, is Retr(P) a complete lattice? Here Retr(P) denotes the set of all retraction operators on P with the pointwise order, that is, \(f\leq g\) in Retr(P) iff f(x)\(\leq g(x)\) for every x in P. An affirmative answer
openaire +2 more sources
Complete Atomic Boolean Lattices
Journal of the London Mathematical Society, 1977openaire +2 more sources
Complete Congruences of Completely Distributive Lattices
Cameron Calk, Luigi Santocanaleopenaire +1 more source