Some Characterizations of Bruhat Ordering on a Coxeter Group and Determination of the Relative Möbius Function
Some characterizations of completeness for trellises in terms of joins of cycles
This paper gives some new characterizations of completeness for trellises by introducing the notion of a cycle-complete trellis. One of our results yields, in particular, a characterization of completeness for trellises of finite length due to K. Gladstien (see K. Gladstien: Characterization of completeness for trellises of finite length, Algebra Universalis 3 (1973), 341–344).
Some Classes of Projective Boolean Algebras.
Some closure properties in monoids.
Some comments and examples on generation of (hyper-)archimedean -groups and -rings
This paper systematizes some theory concerning the generation of -groups and reduced -rings from substructures. We are particularly concerned with archimedean and hyperarchimedean groups and rings. We discuss the process of adjoining a weak order unit to an -group, or an identity to an -ring and find significant contrasts between these cases. In -groups, hyperarchimedeanness and similar properties fail to pass from generating structures to the structures that they generate, as illustrated by...
Some distributivities in GBbi-QRs characterizing Boolean rings
This paper presents some manner of characterization of Boolean rings. These algebraic systems one can also characterize by means of some distributivities satisfied in GBbi-QRs.
Some examples of hyperarchimedean lattice-ordered groups
All ℓ-groups shall be abelian. An a-extension of an ℓ-group is an extension preserving the lattice of ideals; an ℓ-group with no proper a-extension is called a-closed. A hyperarchimedean ℓ-group is one for which each quotient is archimedean. This paper examines hyperarchimedean ℓ-groups with unit and their a-extensions by means of the Yosida representation, focussing on several previously open problems. Paul Conrad asked in 1965: If G is a-closed and M is an ideal, is G/M a-closed? And in 1972:...
Some examples of primitive lattices
Some examples of weakly associative lattices
Some finite congruence lattices, I
Some Fixed Point Theorems in Boolean Algebra
Some fixed point theorems of the mappings of partially ordered sets
Some Geometric Applications of Dilworth's Theorem.
Some ideas for comparison of Bellman chains
In this paper we are exploiting some similarities between Markov and Bellman processes and we introduce the main concepts of the paper: comparison of performance measures, and monotonicity of Bellman chains. These concepts are used to establish the main result of this paper dealing with comparison of Bellman chains.
Some lattices of closure systems on a finite set.
Some Maximal Closed Classes of Operations on Infinite Sets.
Some methods to obtain t-norms and t-conorms on bounded lattices
In this study, we introduce new methods for constructing t-norms and t-conorms on a bounded lattice based on a priori given t-norm acting on and t-conorm acting on for an arbitrary element . We provide an illustrative example to show that our construction methods differ from the known approaches and investigate the relationship between them. Furthermore, these methods are generalized by iteration to an ordinal sum construction for t-norms and t-conorms on a bounded lattice.
Some operations on lattice implication algebras.
Some operations related with translation
Some primitive classes of lattices closed under the formation of projective images