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. AMS (MOS) subject classifications (1970).