The undecidability of the word problems for projective geometries and modular lattices-Reference-Cited by-同舟云学术

The undecidability of the word problems for projective geometries and modular lattices

Published:1974 Issue:0 Volume:193 Page:171-180
ISSN:0002-9947
Container-title:Transactions of the American Mathematical Society
language:en
Short-container-title:Trans. Amer. Math. Soc.

Author:

Lipshitz L.

Abstract

We show that the restricted word problems for finite-dimensional projective geometries and finite modular lattices and the word problem for modular lattices are undecidable.

Publisher

American Mathematical Society (AMS)

Subject

Applied Mathematics,General Mathematics

Link

http://www.ams.org/tran/1974-193-00/S0002-9947-1974-0364040-2/S0002-9947-1974-0364040-2.pdf

Reference10 articles.

1. McGraw-Hill Series in Information Processing and Computers;Davis, Martin,1958

2. Decidability of the elementary theory of relatively complemented lattices and of the theory of filters;Eršov, Ju. L.;Algebra i Logika Sem.,1964

3. The problem of equality of words for certain classes of semigroups;Gurevič, Ju. Š.;Algebra i Logika Sem.,1966

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

1. On the complexity of equational decision problems for finite height complemented and orthocomplemented modular lattices;Algebra universalis;2021-12-31

2. An Algebraic Glimpse at Bunched Implications and Separation Logic;Outstanding Contributions to Logic;2021-12-14

3. Quantum logic is undecidable;Archive for Mathematical Logic;2020-09-11

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

5. On the equational theory of projection lattices of finite von neumann factors;The Journal of Symbolic Logic;2010-09