Sets and Posets with Inversions
For ordered (= partially ordered) sets we introduce certain cardinal characteristics of them (some of those are known). We show that these characteristics—with one exception—coincide.
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).
In this paper, we prove that Eulerian lattices satisfying some weaker conditions for lattices or some weaker conditions for 0-distributive lattices become Boolean.
In this paper we shall give a survey of the most important characterizations of the notion of distributivity in semilattices with greatest element and we will present some new ones through annihilators and relative maximal filters. We shall also simplify the topological representation for distributive semilattices given in Celani S.A., Topological representation of distributive semilattices, Sci. Math. Japonicae online 8 (2003), 41–51, and show that the meet-relations are closed under composition....