TITLE: Existence of an operation $\cdot$ such that $(a*(b*c))=(a\cdot b)*c$
QUESTION [5 upvotes]: When we can define a binary operation $\cdot:M\times M\rightarrow M$ on an algebraic structure $(M,*)$ such that 
$$a*(b*c)=(a\cdot b)*c$$
If $*$ is associative then $\cdot=*$ even if I'm not sure about the uniqueness (But In right-invertible associative structures this is provable)
If $*$ is right-invetible then $a\cdot b=(a*(b*c))\setminus c$ only if $a\cdot b$ doesn't depends on $c$
So my question is

$1$-There is condition weaker than associativity for $*$ that make us able
  to define $a\cdot b$?

I am mainly interested in non-associative, right invertible and/or selfdistributive algebraic structures.

REPLY [2 votes]: Well, there's the obvious equivalent condition:
$$
\forall \, a,b,c \in M, \; \exists  \, x \in M
\text{ such that } a * (b * c) = x * c
$$
Then we can just define $a \cdot b = x$.
This implies the stronger
$$
\forall \, a_1, a_2, \ldots, a_k \in M, \; \exists  \, x \in M
\text{ such that } a_1 * (a_2 * (a_3 * \cdots * (a_{k-1}  * a_k))) = x * a_k
$$
Or, using the usual meaning of applying a binary operation to sets,
$$
\forall \, c \in M, \; \forall k \in \mathbb{N}
\; : \; M \underbrace{* (M * (M * \cdots *(M *}_{k \text{ } *\text{s}}
\{c\}))) \subset M * \{c\}
$$
I realize you probably want a weak condition that looks easy to check and not a strong condition like this, but I think this generates some insight into the nature of those $M$ for which $\cdot$ can be defined.  Essentially, your property is saying: applying $M$ to the left of an set twice will produce a strictly smaller set than applying $M$ to the left of a set once.