Simple and subdirectly irreducibles bounded distributive lattices with unary operators.
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 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.
In this paper, we prove that Eulerian lattices satisfying some weaker conditions for lattices or some weaker conditions for 0-distributive lattices become Boolean.
We consider properties of state filters of state residuated lattices and prove that for every state filter of a state residuated lattice :
We investigate, using results from [[p3]], when a given lattice is isomorphic to the weak subalgebra lattice of a partial algebra of a fixed type. First, we reduce this problem to the question when hyperedges of a hypergraph can be directed to a form of directed hypergraph of a fixed type. Secondly, we show that it is enough to consider some special hypergraphs. Finally, translating these results onto the lattice language, we obtain necessary conditions for our algebraic problem, and also, we completely...
This paper studies basic properties for five special types of implicative ideals (modular, pentagonal, even, rectangular and medial). The results are used to prove characterizations of modularity and distributivity.