Conjugately factorable isotone self-mappings of complete lattices.
Connecting fuzzifying topologies and generalized ideals by means of fuzzy preorders.
Connection between set theory and the fixed point property
Convex isomorphic ordered sets
V. I. Marmazejev introduced in [5] the following concept: two lattices are convex isomorphic if their lattices of all convex sublattices are isomorphic. He also gave a necessary and sufficient condition under which lattices are convex isomorphic, in particular for modular, distributive and complemented lattices. The aim of this paper is to generalize this concept to ordered sets and to characterize convex isomorphic ordered sets in the general case of modular, distributive or complemented ordered...
Convex isomorphism of -lattices
V. I. Marmazejev introduced in [3] the following concept: two lattices are convex isomorphic if their lattices of all convex sublattices are isomorphic. He also gave a necessary and sufficient condition under which the lattice are convex isomorphic, in particular for modular, distributive and complemented lattices. The aim this paper is to generalize this concept to the -lattices defined in [2] and to characterize the convex isomorphic -lattices.
Convex isomorphisms of directed multilattices
By applying the solution of the internal direct product decomposition we investigate the relations between convex isomorphisms and direct product decompositions of directed multilattices.
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...
Correction to the paper “Selfduality of the system of intervals of a partially ordered set”
Corrections à l'article "ordres C.A.C.", Fundamenta Mathematicae 79 (1973), pp. 11-22
Corrigendum: A completion for partially ordered abelian groups.
Countable homogeneous coloured partial orders [Book]
Covering graphs and subdirect decompositions of partially ordered sets
Coxeter classes of unitary reflection groups.
Cuts in cyclically ordered sets
Cycle-free cuts of mutual rank probability relations
It is well known that the linear extension majority (LEM) relation of a poset of size can contain cycles. In this paper we are interested in obtaining minimum cutting levels such that the crisp relation obtained from the mutual rank probability relation by setting to its elements smaller than or equal to , and to its other elements, is free from cycles of length . In a first part, theoretical upper bounds for are derived using known transitivity properties of the mutual rank probability...
Cyclically ordered sets
Cyclically ordered sets as partial algebras
A representation of cyclically ordered sets by means of partial semigroups with an additional unary operation is constructed.