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

DOI10.2307/1996907zbMATH Open0288.02026OpenAlexW4236906058MaRDI QIDQ4775863FDOQ4775863

Authors: Leonard Lipshitz 

Publication date: 1974

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The decision problem for some classes of sentences without quantifiers
• Title not available (Why is that?)
• Title not available (Why is that?)
• Free lattices
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (10)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4775863)