The word problem for free lattice-ordered groups (and some other free algebras)

Author:
Trevor Evans

Journal:
Proc. Amer. Math. Soc. **98** (1986), 559-560

MSC:
Primary 06F15; Secondary 20F10

MathSciNet review:
861749

Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: It is known that in the lattice of all varieties of -groups, there is a unique maximal proper subvariety. Based on this fact we give a simple algorithm for deciding the word problem in free -groups. Some other applications are also given.

**[1]**T. Evans, K. I. Mandelberg, and M. F. Neff,*Embedding algebras with solvable word problems in simple algebras—some Boone-Higman type theorems*, Logic Colloquium ’73 (Bristol, 1973) North-Holland, Amsterdam, 1975, pp. 259–277. Studies in Logic and the Foundations of Mathematics, Vol. 80. MR**0389568****[2]**S. A. Gurchenkov,*Varieties of 𝑙-groups with identity [𝑥^{𝑝},𝑦^{𝑝}]=𝑒 are finitely based*, Algebra i Logika**23**(1984), no. 1, 27–47, 119 (Russian). MR**781403****[3]**W. Charles Holland,*The largest proper variety of lattice ordered groups*, Proc. Amer. Math. Soc.**57**(1976), no. 1, 25–28. MR**0406902**, 10.1090/S0002-9939-1976-0406902-0**[4]**W. Charles Holland and Stephen H. McCleary,*Solvability of the word problem in free lattice-ordered groups*, Houston J. Math.**5**(1979), no. 1, 99–105. MR**533643****[5]**E. B. Scrimger,*A large class of small varieties of lattice-ordered groups*, Proc. Amer. Math. Soc.**51**(1975), 301–306. MR**0384644**, 10.1090/S0002-9939-1975-0384644-7

Retrieve articles in *Proceedings of the American Mathematical Society*
with MSC:
06F15,
20F10

Retrieve articles in all journals with MSC: 06F15, 20F10

Additional Information

DOI:
https://doi.org/10.1090/S0002-9939-1986-0861749-2

Article copyright:
© Copyright 1986
American Mathematical Society