An n-variable associative function is called reducible if it can be written as a composition of a binary associative function. In this paper we summarise the known results when the function is defined on a chain and nondecreasing. The main result of this paper shows that associative idempotent and nondecreasing functions are uniquely reducible.
