Facebook Instagram Twitter RSS Feed PodBean Back to top on side

Iterative separation in distributive congruence lattices

In: Mathematica Slovaca, vol. 59, no. 2
Miroslav Ploščica

Details:

Year, pages: 2009, 221 - 230
Keywords:
algebraic lattice, variety, congruence
About article:
In [PLOŠČICA, M.: \textit{Separation in distributive congruence lattices}, Algebra Universalis \textbf{49} (2003), 1–12] we defined separable sets in algebraic lattices and showed a close connection between the types of non-separable sets in congruence lattices of algebras in a finitely generated congruence distributive variety $\mathcal{V}$ and the structure of subdirectly irreducible algebras in $\mathcal{V}$. Now we generalize these results using the concept of separable mappings (defined on some trees) and apply them to some lattice varieties.
How to cite:
ISO 690:
Ploščica, M. 2009. Iterative separation in distributive congruence lattices. In Mathematica Slovaca, vol. 59, no.2, pp. 221-230. 0139-9918. DOI: https://doi.org/10.2478/s12175-009-0119-2

APA:
Ploščica, M. (2009). Iterative separation in distributive congruence lattices. Mathematica Slovaca, 59(2), 221-230. 0139-9918. DOI: https://doi.org/10.2478/s12175-009-0119-2
About edition: