Abstract
An algorithm for producing identities which hold in any given finite quasigroup is described. Identities produced by the algorithm are used to prove several results concerning varieties of quasigroups. In particular varieties of quasigroups associated with various combinatorial designs are examined.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
