Given an n, this procedure tries every proof until it finds a string and a proof in the formal system S of the formula K(s) ≥ L for some L ≥ n; if no such proof exists, it loops forever.
Given an n this procedure tries every proof until it finds a string and a proof in the for,mal system S of the formula K(s) ≥ L for some L ≥ n; if no such proof exists, it loops forever.