Results 191 to 200 of about 218 (206)
Some of the next articles are maybe not open access.

Complete almost distributive lattices

Asian-European Journal of Mathematics, 2014
In this paper, we introduce the concept of a complete almost distributive lattice (ADL), a zone and a dual zone in a complete ADL and derive their important properties.
G. C. Rao, Venugopalam Undurthi
openaire   +1 more source

Homomorphisms of complete distributive lattices

Quaestiones Mathematicae, 2000
The category of all complete distributive lattices and their complete homomorphisms is universal, and this is also true for the category of all complete distributive lattices whose morphisms preserve complete joins, finite meets and an additional nullary operation.
Pultr, A, Sichler, J, Trnková, V
openaire   +2 more sources

Distributive and completely distributive lattice extensions of ordered sets

International Journal of Algebra and Computation, 2018
It is known that a poset can be embedded into a distributive lattice if, and only if, it satisfies the prime filter separation property. We describe here a class of “prime filter completions” for posets with the prime filter separation property that are completely distributive lattices generated by the poset and preserve existing finite meets and joins.
Wilmari Morton, Clint J. van Alten
openaire   +1 more source

Compactness and Complete Distributivity for Commutative Subspace Lattices

Journal of the London Mathematical Society, 1990
In this note, we show that if \({\mathcal L}\) is a commutative subspace lattice generated by a completely distributive lattice and finitely many commuting chains, then \({\mathcal L}\) is compact in the strong operator topology if and only if \({\mathcal L}\) is completely distributive.
Davidson, Kenneth R., Pitts, David R.
openaire   +2 more sources

Continuous and Completely Distributive Lattices

2014
The study of continuous lattices was initiated by Dana Scott in the late 1960s in order to build mathematical models for certain constructs in theoretical computer science ([638] in LTF), and computational notions and motivations have continued to play a key role in the theory.
Klaus Keimel, Jimmie Lawson
openaire   +1 more source

A generalization of completely distributive lattices

Algebra Universalis, 1990
Let A and B be subsets of the poset (P,\(\leq)\). A is said to be well below B, \(A\ll B\), if whenever D is a directed subset of P for which sup(D) exists and belongs to the upset \(\uparrow B\), one has that \(D\cap \uparrow A\neq \emptyset\). According to Gierz and Lawson, a lattice L is generalized continuous (a GCL), if one has for every x in L ...
openaire   +2 more sources

Affine completions of distributive lattices

Order, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Canonical extensions, free completely distributive lattices, and complete retracts

Algebra Universalis, 2021
Guram Bezhanishvili   +2 more
exaly  

Uniformities on completely distributive lattices

1990
Summary: We extend the definition of uniformity in the form of a system of covers to completely distributive lattices and prove that uniformizability coincides with complete regularity on completely distributive lattice.
openaire   +2 more sources

Home - About - Disclaimer - Privacy