A technical lemma for congruences of finite lattices
classification
🧮 math.RA
keywords
congruenceslemmatechnicalapplicationsdifficultfinitelatticesprove
read the original abstract
The classical Technical Lemma for congruences is not difficult to prove but it is very efficient in its applications. We present here a Technical Lemma for congruences on \emph{finite lattices}. This is not difficult to prove either but it has already has proved its usefulness in some applications.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.