On some algorithmic problems related to varieties of nonassociative rings

MaRDI QIDQ1597968zbMATH OpenFDO

Authors Vladimir Popov

Publication date 28 May 2002

Published in Siberian Advances in Mathematics (Search for Journal in Brave)

zbMATH Keywords

decidable theoryequational theoryfinitely based varietyundecidable theoryvariety of rings

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Lattices of varieties (08B15) Nonassociative algebras satisfying other identities (17A30)

Review text

This is an English translation of the author's article [Mat. Tr. 3, No. 2, 146--170 (2000; Zbl 0967.17001)].

Recommendations

• On some algorithmic problems related to varieties of nonassociative rings
• Algorithmic problems in associative algebras
• scientific article; zbMATH DE number 1071735
• Algorithmic problems in varieties of semigroups
• scientific article; zbMATH DE number 4051899
• scientific article; zbMATH DE number 1553567
• Publication:4735291
• scientific article; zbMATH DE number 56023
• scientific article; zbMATH DE number 125395
• Algorithmic properties of free rings

Cited in

(4)

• On some algorithmic problems related to varieties of nonassociative rings
• Algorithms for near-rings of non-linear transformations
• scientific article; zbMATH DE number 1166208 (Why is no real title available?)
• scientific article; zbMATH DE number 1553567 (Why is no real title available?)

This page was built for publication: On some algorithmic problems related to varieties of nonassociative rings

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