Lexicographic product decompositions of half linearly ordered loops

In this paper we prove for an hl-loop Q an assertion analogous to the result of Jakubík concerning lexicographic products of half linearly ordered groups. We found conditions under which any two lexicographic product decompositions of an hl-loop Q with a finite number of lexicographic factors have isomorphic refinements.