“…In papers [8], [9], [10], [11] and [12], we started the precise investigation of small doubling problems for subsets of an ordered group. We recall that if G is a group and ≤ is a total order relation defined on the set G, then (G, ≤) is an ordered group if for all a, b, x, y ∈ G the inequality a ≤ b implies that xay ≤ xby, and a group G is orderable if there exists an order ≤ on the set G such that (G, ≤) is an ordered group.…”