Page 1

Displaying 1 – 20 of 20

Showing per page

Cantor-Bernstein theorem for lattices

Ján Jakubík (2002)

Mathematica Bohemica

This paper is a continuation of a previous author’s article; the result is now extended to the case when the lattice under consideration need not have the least element.

Classification systems and their lattice

Sándor Radeleczki (2002)

Discussiones Mathematicae - General Algebra and Applications

We define and study classification systems in an arbitrary CJ-generated complete lattice L. Introducing a partial order among the classification systems of L, we obtain a complete lattice denoted by Cls(L). By using the elements of the classification systems, another lattice is also constructed: the box lattice B(L) of L. We show that B(L) is an atomistic complete lattice, moreover Cls(L)=Cls(B(L)). If B(L) is a pseudocomplemented lattice, then every classification system of L is independent and...

Convexity in subsets of lattices.

Sergei V. Ovchinnikov (1980)

Stochastica

The notion of convex set for subsets of lattices in one particular case was introduced in [1], where it was used to study Paretto's principle in the theory of group choice. This notion is based on a betweenness relation due to Glivenko [2]. Betweenness is used very widely in lattice theory as basis for lattice geometry (see [3], and, especially [4 part 1]).In the present paper the relative notions of convexity are considered for subsets of an arbitrary lattice.In section 1 certain relative notions...

Currently displaying 1 – 20 of 20

Page 1