Jednoznačnosť rozkladu sväzu na direktný súčin
Join-closed and meet-closed subsets in complete lattices
To every subset of a complete lattice we assign subsets , and define join-closed and meet-closed sets in . Some properties of such sets are proved. Join- and meet-closed sets in power-set lattices are characterized. The connections about join-independent (meet-independent) and join-closed (meet-closed) subsets are also presented in this paper.
Joins of congruences in -groups
Join-semilattices with two-dimensional congruence amalgamation
We say that a ⟨∨,0⟩-semilattice S is conditionally co-Brouwerian if (1) for all nonempty subsets X and Y of S such that X ≤ Y (i.e. x ≤ y for all ⟨x,y⟩ ∈ X × Y), there exists z ∈ S such that X ≤ z ≤ Y, and (2) for every subset Z of S and all a, b ∈ S, if a ≤ b ∨ z for all z ∈ Z, then there exists c ∈ S such that a ≤ b ∨ c and c ≤ Z. By restricting this definition to subsets X, Y, and Z of less than κ elements, for an infinite cardinal κ, we obtain the definition of a conditionally κ-co-Brouwerian...
Jordan-Hölder Theorem for Lines