Abstract
For each of the relations “less than or equal to”, “less than”, “covered by”, and “covered by or equal to”, we characterize finite orders (also called posets) with the property that the pair of Galois closure operators induced by the relation in question coincides with the pair of closure operators introduced and applied in our previous paper in 2007. We also consider the “less than or equal to” relation between the set of join-irreducible elements and the set of meet-irreducible elements, and we show that the above-mentioned pairs of closure operators coincide for finite modular lattices.
[1] CZÉDLI, G.: 2-uniform congruences in majority algebras and a closure operator, Algebra Universalis 57 (2007), 63–73. http://dx.doi.org/10.1007/s00012-007-2021-510.1007/s00012-007-2021-5Search in Google Scholar
[2] CZÉDLI, G.: A fixed point theorem for stronger association rules and its computational aspects, Acta Cybernet. 19 (2009), 149–158. 10.14232/actacyb.19.1.2009.10Search in Google Scholar
[3] CZÉDLI, G.: Stronger association rules for positive attributes, Novi Sad J. Math. 38 (2008), 103–110. Search in Google Scholar
[4] WILLE, R.: Restructuring lattice theory: an approach based on hierarchies of concepts. In: Ordered sets. Proc. Conf. Banff, Alta., 1981. NATO Adv. Study Inst. Ser. C: Math. Phys. Sci. 83, Reidel, Dordrecht-Boston, Mass, 1982, pp. 445–470. Search in Google Scholar
© 2011 Mathematical Institute, Slovak Academy of Sciences
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.