Recursively unsolvable word problems of modular lattices and diagram- chasing

DOI10.1016/0021-8693(73)90001-XMaRDI QIDQ759047zbMATH OpenFDO

Authors D. Kharzeev

Publication date 1973

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

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3131080 (Why is no real title available?)
• scientific article; zbMATH DE number 3204690 (Why is no real title available?)
• scientific article; zbMATH DE number 3220362 (Why is no real title available?)
• scientific article; zbMATH DE number 3227055 (Why is no real title available?)
• scientific article; zbMATH DE number 3273222 (Why is no real title available?)
• scientific article; zbMATH DE number 3316989 (Why is no real title available?)
• scientific article; zbMATH DE number 3322506 (Why is no real title available?)
• scientific article; zbMATH DE number 3195417 (Why is no real title available?)
• scientific article; zbMATH DE number 3090626 (Why is no real title available?)
• Modular lattices and abelian categories
• Representation of Modular Lattices and Of Relation Algebras

Cited in

(17)

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

This page was built for publication: Recursively unsolvable word problems of modular lattices and diagram- chasing

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