Finitely Presented Lattices
- 1 November 1979
- journal article
- Published by JSTOR in Proceedings of the American Mathematical Society
- Vol. 77 (2) , 174-178
- https://doi.org/10.2307/2042634
Abstract
It is shown that the generalized word problem for lattices is solvable. Moreover, one can recursively decide if two finitely presented lattices are isomorphic. It is also shown that the automorphism group of a finitely presented lattice is finite.Keywords
This publication has 6 references indexed in Scilit:
- Word problemsBulletin of the American Mathematical Society, 1978
- On G. Grätzer's problem concerning automorphisms of a finitely presented latticeAlgebra universalis, 1975
- Lattice Theory: First Concepts and Distributive Lattices.The American Mathematical Monthly, 1973
- The free modular lattice on four generators is not finitely presentableAlgebra universalis, 1972
- The Word Problem for Abstract AlgebrasJournal of the London Mathematical Society, 1951
- The decision problem for some classes of sentences without quantifiersThe Journal of Symbolic Logic, 1943