Free zeropotent left distributive systems
From MaRDI portal
A binary system \(S\) that satisfies the identity \(x(yz)=(xy)(xz)\) is called LD-system, and \(0\in S\) is zero if \(x0=0x=0\) for each \(x\in S\). An LD-system is zeropotent if \(xx=0\) and is called \(m\)-trivial, if the product of at least \(m\) elements associated on the right is always zero. In the paper it is proved that free zeropotent LD-systems are \(m\)-trivial for no \(m\), and, more generally, no identity of the form \(t=0\) holds in these structures when \(t\) is a term with distinct variables.
Recommendations
- scientific article; zbMATH DE number 4156793
- scientific article; zbMATH DE number 4150236
- Free left n-dinilpotent dimonoids
- Free distributive structures over general algebras
- Free distributive groupoids
- The left distributive law and the freeness of an algebra of elementary embeddings
- Free systems of algebras and ultraclosed classes
- Free distributive P-algebras: a new approach
- Free symmetric distributive lattices
- Left division in the free left distributive algebra on many generators
Cites work
- A NORMAL FORM FOR THE FREE LEFT DISTRIBUTIVE LAW
- Braid group actions on left distributive structures, and well orderings in the braid groups
- Braid Groups and Left Distributive Operations
- Free distributive groupoids
- On the algebra of elementary embeddings of a rank into itself
- On the syntactic algorithm for the word problem of left distributivity
- The left distributive law and the freeness of an algebra of elementary embeddings
This page was built for publication: Free zeropotent left distributive systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4392651)
