×
Chajda, Ivan

Distributivity and modularity of lattices of tolerance relations. (English) Zbl 0469.08003

Algebra Univers. 12, 247-255 (1981).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0469.08003

Cited in 13 Documents

MSC:

08B10 Congruence modularity, congruence distributivity
08B05 Equational logic, Mal’tsev conditions
08A30 Subalgebras, congruence relations
08A40 Operations and polynomials in algebraic structures, primal algebras
08A60 Unary algebras

Keywords:

lattice of tolerances; polynomials; distributivity; essentially unary algebras; modularity
PDF BibTeX XML Cite
\textit{I. Chajda}, Algebra Univers. 12, 247--255 (1981; Zbl 0469.08003)
Full Text: DOI
  • logo of hbz
  • logo of WorldCat

References:

[1] A. Day,A characterization of modularity for congruence lattices of algebras, Canad. Math. Bull.12 (1969), 167–173. · Zbl 0181.02302
[2] B. Jónsson,Algebras whose congruence lattices are distributive, Math. Scand21 (1967), 110–121. · Zbl 0167.28401
[3] I. Chajda,Lattices of compatible relations, Archiv. Math. (Brno)13 (1977), 89–96. · Zbl 0372.08002
[4] I. Chajda, B. Zelinka,Lattices of tolerances, Časop. pěst. matem.102 (1977), 10–24. · Zbl 0354.08011
[5] I. Chajda, B. Zelinka,Minimal compatible tolerances on lattices, Czech. Math. J.27 (1977), 452–459. · Zbl 0379.06002
[6] I. Chajda,A characterization of distributive lattices by tolerance lattices, Arch. Math. (Brno),15 (1979), 203–204. · Zbl 0439.06008
[7] I. Chajda,Regularity and permutability of congruences, Algebra Univ.,11 (1980), 159–162. · Zbl 0449.08007
[8] D. Schweigert,On order-polynomially complete algebras, Notices of AMS, vol. 25 (1978), No. 6. · Zbl 0384.06011
[9] H. Werner,A Mal’cev condition on admissible relations, Algebra Univ.3 (1973), 263. · Zbl 0276.08004
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.