The Undecidability of the Word Problems for Projective Geometries and Modular Lattices

DOI10.2307/1996907zbMath0288.02026OpenAlexW4236906058MaRDI QIDQ4775863

Leonard Lipshitz

Publication date: 1974

Full work available at URL: https://doi.org/10.2307/1996907

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Modular lattices, Desarguesian lattices (06C05) Incidence structures embeddable into projective geometries (51A45) Word problems, etc. in computability and recursion theory (03D40) Projective analytic geometry (51N15)

Related Items

Decision problems for distributive lattice-ordered semigroups ⋮ Free Modular Lattices ⋮ Quantum logic is undecidable ⋮ An algebraic glimpse at bunched implications and separation logic ⋮ Rahmen und erzeugende Quadrupel in modularen Verbänden ⋮ A test for identities satisfied in lattices of submodules ⋮ On the complexity of equational decision problems for finite height complemented and orthocomplemented modular lattices ⋮ On the word problem for the modular lattice with four free generators ⋮ Proof theory for linear lattices ⋮ Some algorithmic problems for projective planes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Free lattices
• The decision problem for some classes of sentences without quantifiers

This page was built for publication: The Undecidability of the Word Problems for Projective Geometries and Modular Lattices