Abstract
It is known that in the lattice of all varieties of $l$-groups, there is a unique maximal proper subvariety. Based on this fact we give a simple algorithm for deciding the word problem in free $l$-groups. Some other applications are also given.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
