On multiplicative equivalences that are totally incompatible with division
Sign Up to like & getrecommendations! Published in 2019 at "Algebra universalis"
DOI: 10.1007/s00012-019-0605-5
Abstract: An equivalence \(\sim \) upon a loop is said to be multiplicative if it satisfies \(x\sim y\), \(u \sim v \Rightarrow xu \sim yv\). Let X be a set with elements \(x\ne y\) and let… read more here.
Keywords: incompatible division; multiplicative equivalences; equivalences totally; sim ... See more keywords