Recursively unsolvable word problems of modular lattices and diagram- chasing

DOI10.1016/0021-8693(73)90001-XzbMath0272.06010MaRDI QIDQ759047

D. Kharzeev

Publication date: 1973

Published in: Journal of Algebra (Search for Journal in Brave)

Mathematics Subject Classification ID

Modular lattices, Desarguesian lattices (06C05) Word problems, etc. in computability and recursion theory (03D40) Categorical algebra (18E99)

Related Items

The undecidability of entailment and relevant implication, Decision problems for distributive lattice-ordered semigroups, Free Modular Lattices, Existence varieties of regular rings and complemented modular lattices, Submodule lattice quasivarieties and exact embedding functors for rings with prime power characteristic, Exact embedding functors between categories of modules, Quantum logic as motivated by quantum computing, On the equational theory of projection lattices of finite von neumann factors, The diamond lemma for ring theory, Zum Wortproblem für freie Untermodulverbände, A duality principle for lattices and categories of modules, Embedding and unsolvability theorems for modular lattices, A test for identities satisfied in lattices of submodules, On the word problem for the modular lattice with four free generators, Cut elimination and word problems for varieties of lattices, Exact embedding functors for module categories and submodule lattice quasivarieties, Proof theory for linear lattices

Cites Work

• Modular lattices and abelian categories
• Representation of Modular Lattices and Of Relation Algebras
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item