 In the terminology of that program, the least upper bound principle is equivalent to ACA0 over RCA0.In fact, the proof of the forward implication, i.e.that the least upper bound principle implies ACA0, is readily obtained from the textbook proof (see Simpson, 1999) of the non-computability of the supremum in the least upper bound principle.