Convergences and complete distributivity of lattice ordered groups
Convergences and higher degrees of distributivity of lattice ordered groups and of Boolean algebras
Convergences in Perfect BL-algebras.
Convergences on lattice ordered groups with a finite number of disjoint elements
Convergent regular measures on MV–algebras
We obtain for measures on MV-algebras the classical theorem of Dieudonné related to convergent sequences of regular maps.
Convex automorphisms of a lattice
Convex chains in a pseudo MV-algebra
For a pseudo -algebra we denote by the underlying lattice of . In the present paper we investigate the algebraic properties of maximal convex chains in containing the element 0. We generalize a result of Dvurečenskij and Pulmannová.
Convex directed subgroups of right ordered tree groups
Convex independence and the structure of clone-free multipartite tournaments
We investigate the convex invariants associated with two-path convexity in clone-free multipartite tournaments. Specifically, we explore the relationship between the Helly number, Radon number and rank of such digraphs. The main result is a structural theorem that describes the arc relationships among certain vertices associated with vertices of a given convexly independent set. We use this to prove that the Helly number, Radon number, and rank coincide in any clone-free bipartite tournament. We...
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 Archimedean lattice ordered groups.
This paper contains a result of Cantor-Bernstein type concerning archimedean lattice ordered groups.
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.
Convex lines in median groups
There is proved that a convex maximal line in a median group , containing 0, is a direct factor of .
Convex mappings of archimedean MV-algebras
Convex subsets of partial monounary algebras
Convex-ear decompositions and the flag -vector.
Convexities of lattice ordered groups
In this paper an injective mapping of the class of all infinite cardinals into the collection of all convexities of lattice ordered groups is constructed; this generalizes an earlier result on convexities of -groups.
Convexities of normal valued lattice ordered groups
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...