On some algorithmic problems related to varieties of nonassociative rings

zbMATH Open0987.17001MaRDI QIDQ1597968

Vladimir Popov

Publication date: 28 May 2002

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

zbMATH Keywords

decidable theoryfinitely based varietyequational theoryvariety of ringsundecidable theory

Mathematics Subject Classification ID

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

Related Items (4)

Title not available (Why is that?) ⋮ Algorithms for near-rings of non-linear transformations ⋮ On some algorithmic problems related to varieties of nonassociative rings ⋮ Title not available (Why is that?)

Recommendations

• Algorithmic properties of free rings 👍 👎
• Algorithmic problems in associative algebras 👍 👎
• Algorithmic problems in varieties of semigroups 👍 👎
• On some algorithmic problems related to varieties of nonassociative rings 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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)