Algorithmic solvability of the word problem for some varieties of linear quasigroups.

DOI10.1007/S10958-011-0520-6zbMATH Open1290.20065OpenAlexW2170774461MaRDI QIDQ2248331FDOQ2248331

A. Kh. Tabarov

Publication date: 26 June 2014

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-011-0520-6

zbMATH Keywords

word problemvarieties of linear quasigroups

Mathematics Subject Classification ID

Equational logic, Mal'tsev conditions (08B05) Loops, quasigroups (20N05)

Cites Work

• The Word Problem for Abstract Algebras
• The Isomorphism Problem for Some Classes of Multiplicative Systems
• Varieties of abelian quasigroups
• On the application of permutation groups to some combinatorial problems
• 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?)
• Title not available (Why is that?)

This page was built for publication: Algorithmic solvability of the word problem for some varieties of linear quasigroups.

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