A POLYNOMIAL ALGORITHM FOR TESTING CONGRUENCE MODULARITY
From MaRDI portal
Publication:3837506
DOI10.1142/S0218196796000210zbMath0857.08006MaRDI QIDQ3837506
Christian Herrmann, Marcel Wild
Publication date: 11 March 1997
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
polynomial algorithmcongruence latticecongruence modularitymodular latticefinite algebraclosure systemjoin irreduciblessize of an algebra
Congruence modularity, congruence distributivity (08B10) Modular lattices, Desarguesian lattices (06C05) Galois correspondences, closure operators (in relation to ordered sets) (06A15)
Related Items (3)
Computations with finite closure systems and implications ⋮ A compact representation for modular semilattices and its applications ⋮ On implicational bases of closure systems with unique critical sets.
This page was built for publication: A POLYNOMIAL ALGORITHM FOR TESTING CONGRUENCE MODULARITY