Abstract
A method of constructing a smallest congruence relation that is larger than a given equivalence relation on a lattice is explained. A method of constructing a congruence relation in which equivalence classes contain all least upper bounds and all greatest lower bounds for subsets of equivalence classes is explained; and this method constructs a smallest congruence relation with this property which is also larger than a given congruence relation in a lattice.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
