Finitely Based Congruence Varieties
Ralph Freese, Paolo Lipparini

TL;DR
This paper demonstrates that for many algebraic varieties, the set of all equations describing the structure of their congruence lattices cannot be finitely captured, highlighting inherent complexity.
Contribution
It establishes that the equational theory of congruence lattices is not finitely based for a broad class of algebraic varieties, revealing fundamental limitations.
Findings
Equational theories of congruence lattices are not finitely based.
The result applies to a large class of algebraic varieties.
Highlights complexity in algebraic structure analysis.
Abstract
We show that for a large class of varieties of algebras, the equational theory of the congruence lattices of the members is not finitely based.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Algebra and Logic · Rough Sets and Fuzzy Logic
