Article
Full entry |
PDF
(0.1 MB)
Feedback
Keywords:
Ordered set; morphism; $LU$ compatible equivalence
Ordered set; morphism; $LU$ compatible equivalence
Summary:
A concept of equivalence preserving upper and lower bounds in a poset $P$ is introduced. If $P$ is a lattice, this concept coincides with the notion of lattice congruence.
References:
[1] Chajda, I., Snášel, V.: Congruences in ordered sets. Math. Bohem. 123, 1 (1998), 95–100. MR 1618652
[2] Kolibiar, M.: Congruence relations and direct decomposition of ordered sets. Acta Sci. Math. (Szeged) 51 (1987), 129–135. MR 0911564
[3] Kolibiar, M.: Congruence relations and direct decomposition of ordered sets II. Contributions to General Algebra 6 (1988), 167–171. MR 1078035
[4] Haviar, A., Lihová, J.: Varieties of posets. Order 22, 4 (2005), 343–356. MR 2220344 | Zbl 1109.06002
[5] Halaš, R.: Congruences on posets. Contributions to General Algebra 12 (2000), 195–210. MR 1777659
[6] Halaš, R., Hort, D.: A characterization of 1,2,3,4-endomorphisms of posets. Czech. Math. J. 53, 128 (2003), 213–221. MR 1962010
Search
Partner of