Displaying 581 – 600 of 966

Showing per page

Order affine completeness of lattices with Boolean congruence lattices

Kalle Kaarli, Vladimir Kuchmei (2007)

Czechoslovak Mathematical Journal

This paper grew out from attempts to determine which modular lattices of finite height are locally order affine complete. A surprising discovery was that one can go quite far without assuming the modularity itself. The only thing which matters is that the congruence lattice is finite Boolean. The local order affine completeness problem of such lattices 𝐋 easily reduces to the case when 𝐋 is a subdirect product of two simple lattices 𝐋 1 and 𝐋 2 . Our main result claims that such a lattice is locally...

Orthomodular lattices and closure operations in ordered vector spaces

Jan Florek (2010)

Banach Center Publications

On a non-trivial partially ordered real vector space (V,≤) the orthogonality relation is defined by incomparability and ζ(V,⊥) is a complete lattice of double orthoclosed sets. We say that A ⊆ V is an orthogonal set when for all a,b ∈ A with a ≠ b, we have a ⊥ b. In our earlier papers we defined an integrally open ordered vector space and two closure operations A → D(A) and A A . It was proved that V is integrally open iff D ( A ) = A for every orthogonal set A ⊆ V. In this paper we generalize this result. We...

Partial dcpo’s and some applications

Zhao Dongsheng (2012)

Archivum Mathematicum

We introduce partial dcpo’s and show their some applications. A partial dcpo is a poset associated with a designated collection of directed subsets. We prove that (i) the dcpo-completion of every partial dcpo exists; (ii) for certain spaces X , the corresponding partial dcpo’s of continuous real valued functions on X are continuous partial dcpos; (iii) if a space X is Hausdorff compact, the lattice of all S-lower semicontinuous functions on X is the dcpo-completion of that of continuous real valued...

Currently displaying 581 – 600 of 966