Finitely presented lattices-Reference-Cited by-同舟云学术

Finitely presented lattices

Published:1979 Issue:2 Volume:77 Page:174-178
ISSN:0002-9939
Container-title:Proceedings of the American Mathematical Society
language:en
Short-container-title:Proc. Amer. Math. Soc.

Author:

Freese Ralph,Nation J. B.

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.

Publisher

American Mathematical Society (AMS)

Subject

Applied Mathematics,General Mathematics

Link

http://www.ams.org/proc/1979-077-02/S0002-9939-1979-0542080-8/S0002-9939-1979-0542080-8.pdf

Reference9 articles.

1. Component subsets of the free lattice on 𝑛 generators;Dean, Richard A.;Proc. Amer. Math. Soc.,1956

2. The word problem for abstract algebras;Evans, Trevor;J. London Math. Soc.,1951

3. Word problems;Evans, Trevor;Bull. Amer. Math. Soc.,1978

4. The free modular lattice on four generators is not finitely presentable;Evans, T.;Algebra Universalis,1972

5. On the problem of isomorphism of lattices;Gluhov, M. M.;Soviet Math. Dokl.,1960

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the consistency problem for modular lattices and related structures;International Journal of Algebra and Computation;2016-12

2. Undecidable fragments of elementary theories;Algebra Universalis;1996-03

3. Some Order Theoretic Questions About Free Lattices and Free Modular Lattices;Ordered Sets;1982

4. General Lattice Theory: 1979 Problem Update;Algebra Universalis;1980-12