Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If You Use a Screen Reader

This content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.

The Word Problem for Free Lattice-Ordered Groups (and Some Other Free Algebras)

Trevor Evans
Proceedings of the American Mathematical Society
Vol. 98, No. 4 (Dec., 1986), pp. 559-560
DOI: 10.2307/2045724
Stable URL: http://www.jstor.org/stable/2045724
Page Count: 2
  • Read Online (Free)
  • Download ($30.00)
  • Subscribe ($19.50)
  • Cite this Item
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
Preview not available

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.

Page Thumbnails

  • Thumbnail: Page 
559
    559
  • Thumbnail: Page 
560
    560