Facebook Instagram Twitter RSS Feed PodBean Back to top on side

Some new closures on orders

In: Mathematica Slovaca, vol. 61, no. 6
Gábor Czédli

Details:

Year, pages: 2011, 859 - 870
Keywords:
lattice, order, Galois connection, Galois closure, concept lattice, formal concept analysis
About article:
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.
How to cite:
ISO 690:
Czédli, G. 2011. Some new closures on orders. In Mathematica Slovaca, vol. 61, no.6, pp. 859-870. 0139-9918. DOI: https://doi.org/10.2478/s12175-011-0053-y

APA:
Czédli, G. (2011). Some new closures on orders. Mathematica Slovaca, 61(6), 859-870. 0139-9918. DOI: https://doi.org/10.2478/s12175-011-0053-y
About edition: