Cantor-Bernstein theorem for lattices
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.
Catalogues, treillis de catalogues, génération et décomposition
Chains in modular ternary latticoids
Characterization of all order relations in direct sums of ordered groups.
Characterization of lattices of convex subsets of posets
Characterization of the order induced by uninorm with the underlying drastic product or drastic sum
In this article, we investigate the algebraic structures of the partial orders induced by uninorms on a bounded lattice. For a class of uninorms with the underlying drastic product or drastic sum, we first present some conditions making a bounded lattice also a lattice with respect to the order induced by such uninorms. And then we completely characterize the distributivity of the lattices obtained.
Classification systems and their lattice
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...
Compact connected semilattices without the fixed point property.
Complete co-atomic lattices with enough primes.
Concept lattices of quasiordered sets
Concerning Filtrations on Commutative Rings.
Condition pour que la puissance du treillis complet soit algébrique
Congruence extension and amalgamation in C£.
Congruence relations on direct products of lattices
Construction functors for topological semigroups.
Contexts and sublattices of concept lattices
Continuous lattices and compact Lawson semilattices.
Contributions to some generalizations of lattices
Convex automorphisms of a lattice
Convexity in subsets of lattices.
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...