On the word problem for the modular lattice with four free generators

DOI10.1007/BF01455951zbMath0506.06004MaRDI QIDQ1836679

Christian Herrmann

Publication date: 1983

Published in: Mathematische Annalen (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/163836

zbMATH Keywords

modular latticesfree modular latticeword problem for modular lattices

Mathematics Subject Classification ID

Modular lattices, Desarguesian lattices (06C05) Free lattices, projective lattices, word problems (06B25)

Related Items

The structure of non-Arguesian lattices, Gelfand-Ponomarev and Herrmann constructions for quadruples and sextuples, On the Arithmetic of Projective Coordinate Systems, An equational logic sampler, From multiple sequent for additive linear logic to decision procedures for free lattices, Computer proof of monotonicity of operations on orthomodular lattices, Graphs with given automorphism group and few edge orbits, A field guide to equational logic, The undecidability of the elementary theory of lattices of all equational theories of large signature, Join-semidistributive lattices and convex geometries., Proof theory for linear lattices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recursively unsolvable word problems of modular lattices and diagram- chasing
• On elementary Arguesian lattices with four generators
• Representations of partially ordered sets of infinite type
• Embedding and unsolvability theorems for modular lattices
• S-verklebte Summen von Verbänden
• On coordinates in modular lattices with a homogeneous basis
• The imbedding problem for modular lattices
• Projective Geometries as Projective Modular Lattices
• The Variety of Modular Lattices is Not Generated by its Finite Members
• Free Modular Lattices
• The Undecidability of the Word Problems for Projective Geometries and Modular Lattices