 More generally, a Specker sequence is called a "recursive counterexample" to the least upper bound principle, i.e.a construction that shows that this theorem is false when restricted to computable reals.The least upper bound principle has also been analyzed in the program of reverse mathematics, where the exact strength of this principle has been determined.