A technical lemma for congruences of finite lattices
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 finite lattices. This is not difficult to prove either but it has already has proved its usefulness in some applications.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.