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

Lipshitz, L.

doi:10.1090/S0002-9947-1974-0364040-2

The undecidability of the word problems for projective geometries and modular lattices
HTML articles powered by AMS MathViewer

by L. Lipshitz PDF

Trans. Amer. Math. Soc. 193 (1974), 171-180 Request permission

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.

References

Martin Davis, Computability and unsolvability, McGraw-Hill Series in Information Processing and Computers, McGraw-Hill Book Co., Inc., New York-Toronto-London, 1958. MR 0124208
Ju. L. Eršov, Decidability of the elementary theory of relatively complemented lattices and of the theory of filters, Algebra i Logika Sem. 3 (1964), no. 3, 17–38 (Russian). MR 0180490
Ju. Š. Gurevič, The problem of equality of words for certain classes of semigroups, Algebra i Logika Sem. 5 (1966), no. 5, 25–35 (Russian). MR 0206079
Robin Hartshorne, Foundations of projective geometry, W. A. Benjamin, Inc., New York, 1967. Lecture Notes, Harvard University, 1966/67. MR 0222751
Joachim Lambek, Lectures on rings and modules, Blaisdell Publishing Co. [Ginn and Co.], Waltham, Mass.-Toronto, Ont.-London, 1966. With an appendix by Ian G. Connell. MR 0206032
J. C. C. McKinsey, The decision problem for some classes of sentences without quantifiers, J. Symbolic Logic 8 (1943), 61–76. MR 8991, DOI 10.2307/2268172

Convergent sequences of complete theories

Joseph R. Shoenfield, Mathematical logic, Addison-Wesley Publishing Co., Reading, Mass.-London-Don Mills, Ont., 1967. MR 0225631
Philip M. Whitman, Free lattices, Ann. of Math. (2) 42 (1941), 325–330. MR 3614, DOI 10.2307/1969001
John von Neumann, Continuous geometry, Princeton Mathematical Series, No. 25, Princeton University Press, Princeton, N.J., 1960. Foreword by Israel Halperin. MR 0120174